Find the Length of the Collatz Sequence
Given a positve integer n, find the length of its Collatz sequence. The Collatz sequence is generated sequentially where: n = n / 2 if n is even n …
Teaching Kids Programming – Solving the Jump Game by Depth First Search Algorithm
Teaching Kids Programming: Videos on Data Structures and Algorithms Yesterday, we talked about the Breadth First Search Algorithm. We are solving the same Jump Game problem today by using …
Algorithm to Compute the Concatenation of Consecutive Binary Numbers
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 …
Depth First Search Algorithm to Delete Even Leaves from Binary Tree
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 – Revisit Breadth First Search Algorithm via a Jumping Game
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 …
Using a Hash Table to Find A Number and Its Triple in a List
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 …