GoLang: Insert into a Binary Search Tree via Recursion
Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root node …
Category: Go Programming
GoLang: Sign of the Product of an Array
There is a function signFunc(x) that returns: 1 if x is positive. -1 if x is negative. 0 if x is equal to 0. You are given an integer …
GoLang: Compute the Hamming Distance
The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Given two integers x and y, return the Hamming distance between …
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 …
GoLang Function to Check if a String is a Subsequence of Another
Given two strings s and t, return true if s is a subsequence of t, or false otherwise. A subsequence of a string is a new string that is …