EJSohn

func searchRange(nums []int, target int) []int {
    // empty nums case
    if len(nums) == 0 {
        return []int{-1, -1}
    }
    // find starting and ending
    return []int{findStarting(nums, target), findEnding(nums, target)}
}

func findStarting(nums []int, target int) int {

EJSohn

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func deleteDuplicates(head *ListNode) *ListNode {
    // check head isn't nil (null)
    if head == nil {

EJSohn

func twoSum(nums []int, target int) []int {
    // map from int -> int
    m := make(map[int]int)
    
    // python like enumerate
    for i, num := range(nums) {
        // get value and check existence in map
        // and in if statement where ok is the boolean comparison value
        if index, ok := m[target - num]; ok { 
            // construct array and return values 

EJSohn

// Walk walks the tree t sending all values
// from the tree to the channel ch.
func Walk(t *tree.Tree, ch chan int) {
    recursiveWalk(t, ch)
    close(ch) // close channel when done
}

func recursiveWalk(t *tree.Tree, ch chan int) {
    if t != nil {
        // in order

EJSohn

def sum_lst(lst):
  tot = 0
  for val in lst:
    tot += val
  return tot
  # or return sum(lst) ¯\_(ツ)_/¯

EJSohn

def sum_list(lst):
  tot = 0
  for val in lst:
    tot += val
  return tot

EJSohn

func sumSlice(slice []int) int {
  tot := 0
  for _, val := range slice {
    tot += val
  }
  return tot
}

EJSohn

struct LinkNode {
  Value int
  Prev, Next *LinkNode
}

EJSohn

// c like struct
type TreeNode struct {
    Value int
    Left, Right *TreeNode // pointers
}


func DfsInOrder(treeNode *TreeNode) {
    if treeNode == nil {
        return

EJSohn

func twoSum(nums []int, target int) []int {
    // map from int -> int
    m := make(map[int]int)
    
    // python like enumerate
    for i, num := range(nums) {
        // get value and check existence in map
        // and in if statement where ok is the boolean comparison value
        if index, ok := m[target - num]; ok { 
            // construct array and return values