leogsouza

package main

import "math"

func round(f float64) int {
    if math.Abs(f) < 0.5 {
        return 0
    }
    return int(f + math.Copysign(0.5, f))
}

leogsouza

package main

func twoSum(nums []int, target int) []int {
  for i := 0; i < len(nums); i++ {
    for j := 1; j < len(nums); j++ {
      if nums[j] == target - nums[i] {
        return []int{i, j}
      }
    }
  }

leogsouza

Keybase proof

I hereby claim:

• I am leogsouza on github.
• I am leogsouza (https://keybase.io/leogsouza) on keybase.
• I have a public key ASDKdXE7emHpAiW1Wrx9fCnncnDXuyQAHabBgfkULGJQHwo

To claim this, I am signing this object:

leogsouza

Download with

`for ll in $(cat links.txt); do wget --user-agent="Mozilla/4.0 (compatible; MSIE 6.0; Windows NT 5.1; SV1)" $ll & done;`

leogsouza

GROKKING NOTES

I liked the way Grokking the coding interview organized problems into learnable patterns. However, the course is expensive and the majority of the time the problems are copy-pasted from leetcode. As the explanations on leetcode are usually just as good, the course really boils down to being a glorified curated list of leetcode problems.

So below I made a list of leetcode problems that are as close to grokking problems as possible.

Pattern: Sliding Window

• https://leetcode.com/problems/maximum-subarray/ # Close enough
• https://leetcode.com/problems/minimum-size-subarray-sum/