Skip to content

Instantly share code, notes, and snippets.

View nleiva's full-sized avatar
☠️
Working from somewhere

Nicolas Leiva nleiva

☠️
Working from somewhere
200 followers · 16 following
View GitHub Profile
@nleiva
nleiva / maxones.go
Created February 25, 2018 02:13
Max Consecutive Ones (485) from https://leetcode.com/problems/max-consecutive-ones/description/.
func findMaxConsecutiveOnes(nums []int) int {
total := 0
max := 0
for i := 0; i < len(nums); i++ {
if nums[i] == 1 {
total++
if total > max {
max = total
}
} else {
@nleiva
nleiva / combinations.go
Created February 26, 2018 21:16
Combinations (77) from https://leetcode.com/problems/combinations/description/ ....too compex :-(
// Slice implements sort.Interface
type Slice []int
func (a Slice) Len() int { return len(a) }
func (a Slice) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
func (a Slice) Less(i, j int) bool { return a[i] < a[j] }
func combine(n int, k int) [][]int {
a := []int{}
for i := 1; i <= n; i++ {
@nleiva
nleiva / shrange.go
Created February 28, 2018 21:00
SHORTEST RANGE IN K SORTED LISTS from https://www.youtube.com/watch?v=zplklOy7ENo, first take (not optimal)
package main
import (
"fmt"
"sort"
)
type Slice []int
func (a Slice) Len() int { return len(a) }
@nleiva
nleiva / shrange.go
Created March 1, 2018 03:28
SHORTEST RANGE IN K SORTED LISTS from https://www.youtube.com/watch?v=zplklOy7ENo, solution explained in the video
package main
import (
"container/heap"
"fmt"
)
type mHeap struct {
value int
array int
@nleiva
nleiva / threesum.go
Created March 14, 2018 03:28
3Sum (15) from https://leetcode.com/problems/3sum/description/ ....too slow :-(
func threeSum(nums []int) [][]int {
result := [][]int{}
check := make(map[int]bool)
for i := 0; i < len(nums)-2; i++ {
if check[nums[i]] {
continue
}
for _, v := range twoSum(nums[i+1:], -nums[i]) {
if !(check[v[0]] || check[v[1]]) {
result = append(result, append(v, nums[i]))
@nleiva
nleiva / maxdepth.go
Last active March 14, 2018 16:19
Maximum Depth of Binary Tree (104) from https://leetcode.com/problems/maximum-depth-of-binary-tree/description/
func maxDepth(root *TreeNode) int {
if root == nil {
return 0
}
d := 1 + max(maxDepth(root.Right), maxDepth(root.Left))
return d
}
func max(a, b int) int {
if a > b {
@nleiva
nleiva / gwaddr.go
Created July 11, 2018 17:46
func main() {
ipn := &net.IPNet{
IP: net.IPv4(10,200,0,0),
Mask: net.CIDRMask(24, 32),
}
gw := calcGatewayIP(ipn)
fmt.Printf("%v", gw )
}
@nleiva
nleiva / ec2-go.sh
Last active July 2, 2019 20:48
Install Go in EC2
#!/bin/bash
sudo apt-get update
sudo apt-get -y upgrade
sudo apt-get -y install make
curl -O https://storage.googleapis.com/golang/go1.12.6.linux-amd64.tar.gz
tar -xvf go1.12.6.linux-amd64.tar.gz
sudo mv go /usr/local
echo 'export PATH=$PATH:/usr/local/go/bin
@nleiva
nleiva / grpc-insecure.go
Created July 9, 2019 00:14
// Client
conn, err := grpc.Dial(address, grpc.WithInsecure())
if err != nil {
log.Fatalf("did not connect: %v", err)
}
defer conn.Close()
// Server
s := grpc.NewServer()
// ... register gRPC services ...
@nleiva
nleiva / grpc-no-auth.go
Created July 9, 2019 00:19
// Client
config := &tls.Config{
InsecureSkipVerify: true,
}
conn, err := grpc.Dial(address, grpc.WithTransportCredentials(credentials.NewTLS(config)))
if err != nil {
log.Fatalf("did not connect: %v", err)
}
defer conn.Close()