Given a binary tree root, repeatedly delete all leaves that have even values. That is, if after deletions, a node becomes a leaf with an even value, it too …
Teaching Kids Programming: Videos on Data Structures and Algorithms BFS (Breadth First Search) is one of the most classic algorithms in Computer Science. Given an array of non-negative integers …
Given a list of integers nums, return whether there’s two numbers such that one is a triple of another. Constraints n ≤ 100,000 where n is the length of …
Teaching Kids Programming: Videos on Data Structures and Algorithms Compute the Average The average of some numbers can be comptued as the sum of them divided by the number …
Given an integer n, return whether it is equal to the sum of its own digits raised to the power of the number of digits. Example 1 Input n …
Teaching Kids Programming: Videos on Data Structures and Algorithms Greate Common Divisor Algorithm GCD aka Greatest Common Disvisor is the largest common divisor of two positive integers. For example, …