Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Speedy category for Find Sequence by gntontos
def checkio(matrix):
n = len(matrix)
for r in range(0,n-3):
for c in range(0,n):
if matrix[r][c] == matrix[r+1][c] == matrix[r+2][c] == matrix[r+3][c]:
return True
if c < n-3:
if matrix[r][c] == matrix[r+1][c+1] == matrix[r+2][c+2] == matrix[r+3][c+3]:
return True
if c > n-3:
if matrix[r][c] == matrix[r+1][c-1] == matrix[r+2][c-2] == matrix[r+3][c-3]:
return True
for c in range(0,n-3):
for r in range(0,n):
if matrix[r][c] == matrix[r][c+1] == matrix[r][c+2] == matrix[r][c+3]:
return True
return False
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert checkio([
[1, 2, 1, 1],
[1, 1, 4, 1],
[1, 3, 1, 6],
[1, 7, 2, 5]
]) == True, "Vertical"
assert checkio([
[7, 1, 4, 1],
[1, 2, 5, 2],
[3, 4, 1, 3],
[1, 1, 8, 1]
]) == False, "Nothing here"
assert checkio([
[2, 1, 1, 6, 1],
[1, 3, 2, 1, 1],
[4, 1, 1, 3, 1],
[5, 5, 5, 5, 5],
[1, 1, 3, 1, 1]
]) == True, "Long Horizontal"
assert checkio([
[7, 1, 1, 8, 1, 1],
[1, 1, 7, 3, 1, 5],
[2, 3, 1, 2, 5, 1],
[1, 1, 1, 5, 1, 4],
[4, 6, 5, 1, 3, 1],
[1, 1, 9, 1, 2, 1]
]) == True, "Diagonal"
Aug. 2, 2017
Comments: