This is a dangerous execute that doesn't check the query. Validate before calling. Note: Currently, environments from one call don't carry over to th

String representation of this instance.

String representation of the class instance. Examples: Token(INTEGER, 3) Token(PLUS, '+')

Space: O(n/2) for sort, time: (n). This can be optimized by doing initial file read in one pass rather than three.

Returns all the prime factors in order from least to greatest. There may be repeat factors. Ex: For 12, returns 2,2,3. Returns empty list for numbers

@param num must be greater than 0

Takes a string of space-separated digits and converts it to a int array. @param digitsString single-space-separated digits @return array of digits fro

Takes a string of space-separated digits and converts it to a int array. @param digitsString single-space-separated digits @return array of digits fro

Return the number of Sundays that fell on the first of the month from dateFrom to dateTo. One optimization would be to only create the GregorianCalend

expr -> INTEGER PLUS INTEGER

expr -> INTEGER PLUS INTEGER expr -> INTEGER MINUS INTEGER expr -> INTEGER MULTIPLY INTEGER expr -> INTEGER DIVIDE IN

Return the sum of the digits in the number n!.

Return factorial for small numbers that would result in less than Long.MAX_VALUE.

Returns a factor pair if found, otherwise null.

The intuition for this is zigzagging up and right in a multiplication chart until the value if found or is out of bounds. Chart is symmetrical, so cou

Return list of amicable numbers. If none are found, then return an empty list. @param lowBound lower bound, inclusive @param highBound higher bound, e

Return a new list that contains all the duplicate numbers from input. Or, if there are no duplicates (or input is null), then return empty list. Note:

Return the denominator for the longest repeating decimal for fractions from 1/1, 1/2, 1/3, 1/4 to 1/highBound. Thoughts: - In order for a fraction to

Return the index of the matching parenthesis, given the index of the open parenthesis. Return -1 if a matching parenthesis isn't found. Idea: This co

Return list of abundant numbers between lowBound and highBound, inclusive. If none, then return an empty list.

Returns all factors for input, including 1 and the number. Ex: For 12, this returns [1,2,3,4,6,12]. Returns an empty list for input less than 1. This

* Get the current URL. * * @param {function(string)} callback - called when the URL of the current tab * is found.