A Quadtree is a data structure that allows two dimensional data, such as images or matrices, to be represented and traversed as a tree.

Read More >>Given a function called rand5() that returns a random number between 1 and 5, write a function called rand2() that returns a number between 1 and 2.

Read More >>Given a function called rand5() that returns a random number between 1 and 5, write a function called rand7() that returns a number between 1 and 7.

Read More >>Write a function that prints the numbers 1 to 100. If the number is a multiple of 3, print fizz instead of the number. If the number is a multiple of 5, print buzz instead of the number. If the number is a multiple of both 3 and 5, print fizzbuzz instead of the number.

Read More >>For a given binary tree, determine whether it is height balanced, where height balanced is defined as a tree in which the absolute difference between the heights of the left and right sub-trees is no greater than 1.

Read More >>Write a function that takes an unsigned integer X and returns an integer representing the number of bits set to 1 in X.

Read More >>A Fenwick Tree, also known as a Binary Indexed Tree, is a tree structure that allows for a balanced load between updates and summations when trying to efficiently calculate prefix sums.

Read More >>Write a function that takes an array of ticker prices for a given stock, and returns the maximum profit possible in that time frame.

Read More >>Breadth first search (sometimes referred to as BFS) is an algorithm for traversing a graph or tree. We traverse the tree or graph by examining all nodes at a given level, before moving on to the next level of nodes.

Read More >>Depth first search (sometimes referred to as DFS) is an algorithm for traversing a graph or tree.

Read More >>