Category: algorithms
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 a list of non-negative integers nums, return the total number of 3 unique numbers that can create a triangle. Constraints n ≤ 1,000 where n is the length …
Teaching Kids Programming: Videos on Data Structures and Algorithms Given two binary trees node0 and node1, return a merge of the two trees where each value is equal to …
Given a list of integers nums and an integer k, return a list of count of distinct numbers in each window of size k. Constraints 1 ≤ k ≤ …
Teaching Kids Programming: Videos on Data Structures and Algorithms The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Given two …