Leetcode Weekly Contest 427 All Solutions

[@ArnabBhadra02]

Soln2: class Solution: def maxRectangleArea(self, points): n = len(points) point_set = {f"{x},{y}" for x, y in points} max_area = -1 for i in range(n): for j in range(i + 1, n): x1, y1 = points[i] x2, y2 = points[j] if x1 != x2 and y1 != y2: corner1 = f"{x1},{y2}" corner2 = f"{x2},{y1}" if corner1 in point_set and corner2 in point_set: if self.is_rectangle_valid(points, x1, y1, x2, y2): area = abs(x1 - x2) * abs(y1 - y2) max_area = max(max_area, area) return max_area def is_rectangle_valid(self, points, x1, y1, x2, y2): min_x, max_x = min(x1, x2), max(x1, x2) min_y, max_y = min(y1, y2), max(y1, y2) for px, py in points: if ((min_x < px < max_x and min_y < py < max_y) or ((px == min_x or px == max_x) and min_y < py < max_y) or ((py == min_y or py == max_y) and min_x < px < max_x)): return False return True

[@ArnabBhadra02]

Soln3: class Solution: def maxSubarraySum(self, nums, k): n = len(nums) prefix_sum = [0] * (n + 1) for i in range(n): prefix_sum[i + 1] = prefix_sum[i] + nums[i] min_prefix_sum = [float('inf')] * k max_sum = float('-inf') for i in range(n + 1): remainder = i % k if i >= k: max_sum = max(max_sum, prefix_sum[i] - min_prefix_sum[remainder]) min_prefix_sum[remainder] = min(min_prefix_sum[remainder], prefix_sum[i]) return 0 if max_sum == float('-inf') else max_sum

[@ArnabBhadra02]

Soln1: class Solution: def constructTransformedArray(self, nums): n = len(nums) result = [] for i, steps in enumerate(nums): index = (i + steps % n + n) % n result.append(nums[index]) return result

[@SRUTHI.28]

soln 4 pls

[@heytopg]

class Solution: def maxRectangleArea(self, xCoord, yCoord): points = list(zip(xCoord, yCoord)) point_set = set(points) max_area = -1 for i in range(len(points)): for j in range(i + 1, len(points)): x1, y1 = points[i] x2, y2 = points[j] if x1 != x2 and y1 != y2: corner1 = (x1, y2) corner2 = (x2, y1) if corner1 in point_set and corner2 in point_set: area = abs(x1 - x2) * abs(y1 - y2) if self.is_rectangle_valid(point_set, x1, y1, x2, y2): max_area = max(max_area, area) return max_area def is_rectangle_valid(self, point_set, x1, y1, x2, y2): min_x, max_x = min(x1, x2), max(x1, x2) min_y, max_y = min(y1, y2), max(y1, y2) for px, py in point_set: if min_x < px < max_x and min_y < py < max_y: return False return True check for xCoord = [1, 1, 3, 3, 1, 3] yCoord = [1, 3, 1, 3, 2, 2]