GoLang: Compute the Middle of a Linked List
Given a non-empty, singly linked list with head node head, return a middle node of linked list. If there are two middle nodes, return the second middle node. Example …
Tag: GoLang
GoLang: Algorithm to Compute the Range Sum of a Binary Search Tree
Given the root node of a binary search tree, return the sum of values of all nodes with a value in the range . GoLang Implementation: Range Sum of …
Merge Two Sorted Linked List using GoLang
Merge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the nodes of the first two lists. Example 1: …
Invert a Binary Tree using GoLang
This problem was inspired by this original tweet by Max Howell: Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree …
Go Lang Programming Exercise: Single-Row Keyboard
There is a special keyboard with all keys in a single row. Given a string keyboard of length 26 indicating the layout of the keyboard (indexed from 0 to …