GoLang: Recursive Algorithm to Clone N-ary Tree
Given a root of an N-ary tree, return a deep copy (clone) of the tree. Each node in the n-ary tree contains a val (int) and a list (List) …
GoLang: Merge Strings Alternately
You are given two strings word1 and word2. Merge the strings by adding letters in alternating order, starting with word1. If a string is longer than the other, append …
Teaching Kids Programming – Substrings of Size Three with Distinct Characters
Teaching Kids Programming: Videos on Data Structures and Algorithms A string is good if there are no repeated characters. Given a string s, return the number of good substrings …
Teaching Kids Programming – Interval Overlaps via Two Pointer Algorithm
Teaching Kids Programming: Videos on Data Structures and Algorithms You are given a list of closed intervals l0 and another list of intervals l1. Individually, each list is non-overlapping …
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 …
Teaching Kids Programming – Check if Word Equals Summation of Two Words
Teaching Kids Programming: Videos on Data Structures and Algorithms The letter value of a letter is its position in the alphabet starting from 0 (i.e. ‘a’ -> 0, ‘b’ …