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 …
Category: algorithms
Teaching Kids Programming – Check if the Sentence Is Pangram
Teaching Kids Programming: Videos on Data Structures and Algorithms A pangram is a sentence where every letter of the English alphabet appears at least once. Given a string sentence …
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 …
Teaching Kids Programming – Longest Common Prefix Algorithm
Teaching Kids Programming: Videos on Data Structures and Algorithms Given a list of lowercase alphabet strings words, return the longest common prefix. Example 1 Input words = Output “ant” …
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 …