Return the proper divisors for n or an empty list is n <= 1.

Return the proper divisors for n or an empty list is n <= 1.

Return the first term in the Fibonacci sequence to contain n digits, where n >= 1.

Calculate the sum of the list of numbers, then return the first N digits. Space: O(1), time: O(n). A speed improvement would be to only calculate the

Ideas for improvement: - Check for zeros and skip some indexes - Possibly experiment with lambda for Java 8 Space: O(1), time: (n) @param givenNumber

Returns the first triangle number to have greater than the specified number of factors. Space: O(n), time: O(n n)

* @param {string} searchTerm - Search term for Google Image search. * @param {function(string,number,number)} callback - Called when an image has *

Returns largest node in stack. This is a O(n) operation.

Solves via brute force: Tests all combinations of 3-digit numbers as palindrome. Space: O(1), Time: O(n^2)

This can be improved to work better with larger numbers. Space: O(n), Time: O(n) @param value the number to factor @return prime factor

This can be improved to work better with larger numbers. Space: O(n), Time: O(n), with better space than v1. @param value the number to factor @return

Returns the largest product with `numAdjacent` numbers that are in a single direction (up, down, left, right, or diagonally). To do that, this iterate

/ Returns the least common multiple of all numbers in list. If list is null or empty, then returns INVALID_INPUT = -1. Note: The current version of t

Return a list of names. If there is an error, then returns an empty list.

Space: O(n), time: O(n) @param max positive number for max possible starting sequence

Return the index with the max value. This searches iteratively. If there are multiple max values, then the first one found will be used. @throws java.

Return the index with the max value. This searches iteratively. If there are multiple max values, then the first one found will be used. @throws java.

Return the maximum total from top to bottom of the triangle of digits provided. If the input is null or empty, then returns zero. Space: O(width), ti

Return the maximum total from top to bottom of the triangle of digits provided. If the input is null or empty, then returns zero. Space: O(width), ti

Return the nth lexicographic permutation. Space: O(log(n)) due to recursive, time: O(log(n)) @param s the list of characters to permutate, should alre

Space: O(), time: O() @param position which prime @return prime number at nth position

Return the number of unique lattice/edge paths from corner to corner on a grid of squares. Note: The sum of width and height currently must be less th

Returns an array of only prime numbers up to max.

Returns the product of all the digits in the array.

Returns the product of `numAdjacent` numbers in the direction specified. @return product, or 0 if not enough space

Returns the product of `numAdjacent` numbers in the direction specified. @return product, or 0 if not enough space

Returns the product of `numAdjacent` numbers in the direction specified. @return product, or 0 if not enough space

Return the product of coefficients, a and b, for the quadratic expression that products the maximum number of primes for consecutive values of n. Spa

Returns the product of `numAdjacent` numbers in the direction specified. @return product, or 0 if not enough space

Returns the Pythagorean triplet that adds up to `sum` or null if no such triplet

Override this to set the debug log tag name. There may also be other uses in the future.

Override this to set the debug log tag name. There may also be other uses in the future.

Space: O(1), Time: O(n) @param below find only multiples below this number @return sum, which may overflow

Space: O(1), Time: O(n), but faster than v1 because this only iterates over the multiples and has no other checks. @param below find only multiples be

Return the sum of the amicable numbers for n.

Return the sum of the numbers on the diagonals in a 1001 by 1001 spiral square. Space: O(1), time: O(n) @return sum of numbers on diagonal

Return the sum of digits of the input number. Space: O(n), time: O(n). An optimization in space would be to iterate through each character in the stri

Space: O(1), Time: O(n). @param max the maximum value for fibonacci numbers in sequence @return sum, which may overflow

Space: O(n), time: O(n) @param max primes from 2 to this number @return sum of primes up to below

Solves via brute force. Space: O(), time: O() @param numbers list of numbers to compare @return sum

Returns true if input is a palidrone, otherwise false. This treats negative numbers just like positive numbers.

Returns true if input deck is a single rifle shuffle, otherwise false. Deck sizes of 3 or less will always return true because regardless of the numbe