I hereby claim:
- I am igomez10 on github.
- I am igomeza (https://keybase.io/igomeza) on keybase.
- I have a public key ASCj45McbWrATK4gKFxokvsn3O2f1gPXEEtVnaRFVfp4tQo
To claim this, I am signing this object:
apiVersion: v1 | |
clusters: | |
- cluster: | |
certificate-authority-data: DATA+OMITTED | |
server: 1.2.3.4 | |
name: default | |
contexts: | |
- context: | |
cluster: default | |
user: default |
I hereby claim:
To claim this, I am signing this object:
package main | |
import "fmt" | |
type hack struct { | |
value interface{} | |
} | |
func main() { |
package main | |
import ( | |
"fmt" | |
"log" | |
) | |
type singlyLinkedListNode struct { | |
data int32 | |
next *singlyLinkedListNode |
fs := http.FileServer(http.Dir(".")) | |
http.Handle("/", fs) | |
http.ListenAndServe(":8080", nil) |
from collections import deque | |
def getBiggestRegion(grid): | |
def size(i, j): | |
if 0 <= i < len(grid) and 0 <= j < len(grid[i]) and grid[i][j] == 1: | |
grid[i][j] = 0 | |
counter = sum([size(i2,j2) for i2 in range(i-1, i+2) for j2 in range(j-1, j+2)]) | |
return 1 + counter | |
return 0 | |
return(max( size(a,b) for a in range(len(grid)) for b in range( len(grid[a])) )) | |