Category: algorithms
Given an integer n, return the decimal value of the binary string formed by concatenating the binary representations of 1 to n in order, modulo 10^9 + 7. Example …
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 …