Tag: GoLang
A pangram is a sentence where every letter of the English alphabet appears at least once. Given a string sentence containing only lowercase English letters, return true if sentence …
Given a binary tree, each node has value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit. For example, if the path …
Given a binary tree root, find the sum of the deepest node values. Constraints n ≤ 100,000 where n is the number of nodes in root Hint: You need …
Given an array arr of integers, check if there exists two integers N and M such that N is the double of M ( i.e. N = 2 * …
The product sum of two equal-length arrays a and b is equal to the sum of a * b for all 0 <= i < a.length (0-indexed). For example, …