Discussion on Ema's Supercomputer Challenge

1 month ago+ 0 comments

I finally got some code that worked! For my approach, I found every cell that was good. Then, I checked how far each arm could reach. The largest plus with the middle in that cell would then be the minimum size of arms. However, we also need to add all of the pluses that are smaller than that. Then, we can compare every plus with every other plus to see if they overlap. If they don't overlap, we record the product. Once we have all the products, we return the largest one.

def twoPluses(grid):
    sizes = []
    middles = []
    products = []
    for row in range(len(grid)):
        for col in range(len(grid[0])):
            if grid[row][col] == "G":
                segments = []
                count = 0
                index = row
                while index >= 1 and grid[index - 1][col] == "G":
                    index -= 1
                    count += 1
                segments.append(count)
                count = 0
                index = row
                while index < len(grid) - 1 and grid[index + 1][col] == "G":
                    index += 1
                    count += 1
                segments.append(count)
                count = 0
                index = col
                while index >= 1 and grid[row][index - 1] == "G":
                    index -= 1
                    count += 1
                segments.append(count)
                count = 0
                index = col
                while index < len(grid[0]) - 1 and grid[row][index + 1] == "G":
                    index += 1
                    count += 1
                segments.append(count)
                for size in range(min(segments) + 1):
                    sizes.append(size)
                    middles.append((row, col))
    for p1 in range(len(middles)):
        for p2 in range(p1 + 1, len(middles)):
            plus1 = set()
            plus2 = set()
            row1 = middles[p1][0]
            col1 = middles[p1][1]
            row2 = middles[p2][0]
            col2 = middles[p2][1]
            for add in range(-sizes[p1], sizes[p1] + 1):
                plus1.add((row1 + add, col1))
                plus1.add((row1, col1 + add))
            for add in range(-sizes[p2], sizes[p2] + 1):
                plus2.add((row2 + add, col2))
                plus2.add((row2, col2 + add))
            product = (4 * sizes[p1] + 1) * (4 * sizes[p2] + 1)
            if plus1.isdisjoint(plus2):
                products.append(product)
    if products:
        return max(products)
    return 0

Cookie support is required to access HackerRank

Please signup or login in order to view this challenge