Interview. Data structures Aug 4, 2018 algorithms interview golang season_01 Linked list Model type Node struct { data int32 next *Node } Iteration through // node *Node - the first element of llist for { if node==nil{ break } //OPERATIONS WITH CURRENT NODE node = node.next } Links hackerrank. Print in Reverse hackerrank. Inserting a Node Into a Sorted Doubly Linked List hackerrank. Delete duplicate-value nodes from a sorted linked list Golang Compact If if stacks = removeFromHighest(stacks); stacks == nil { return 0 } Links hackerrank. Equal Stacks Effective Go