Easy Difficulty

For this challenge you will be reversing a string.
For this challenge you will be determining the factorial for a given number.
For this challenge you will be determining the largest word in a string.
For this challenge you will be manipulating characters in a string based off their positions in the alphabet.
For this challenge you will be adding up all the numbers from 1 to a certain argument.
For this challenge you will be capitalizing certain characters in a string.
For this challenge you will be determining whether or not certain characters are in correct positions.
For this challenge you will be comparing two numbers and determining which one is greater.
For this challenge you will be determining the difference in hours and minutes between two given times.
For this challenge you will be sorting characters in a string.
For this challenge you will determine if two characters are separated a specific way in the string.
For this challenge you will be counting all the vowels in a string.
For this challenge you will be determining how many words a sentence contains.
For this challenge you will traverse a string and determine if there is an equal amount of certain characters.
For this challenge you will determine if a string is written the same way forward and backwards.
For this challenge you will determine if numbers within an array follow an arithmetic or geometric sequence.
For this challenge you will determine if numbers in an array can add up to a certain number in the array.
For this challenge you will determine which word has the greatest number of repeated letters.
For this challenge you will determine the second lowest and greatest numbers in an array.
For this challenge you will divide two numbers and return them in a certain format.
For this challenge you will return the total number of minutes between two times.
For this challenge you will determine if the mode equals the mean in an array.
For this challenge you will be manipulating a string using dashes (-).
For this challenge you will be swapping the case of each character in the string.
For this challenge you will traverse a string searching for all the numbers and then you will add them up.
For this challenge you will determine the third largest string within an array.
For this challenge you will be determining whether or not a number is a power of two.
For this challenge you will be determining the additive persistence for a given number.
For this challenge you will be determining the multiplicative persistence for a given number.
For this challenge you will be creating a subset of an array.

Medium Difficulty

For this challenge you will be determining if an argument is a prime number.
For this challenge you will determine the Run Length Encoding of a string.
For this challenge you will be returning a certain prime number.
For this challenge you will be determining if a string is a palindrome.
For this challenge you will determine the Greatest Common Factor between two numbers.
For this challenge you will determine if string 1 can be rearranged into string 2.
For this challenge you will determine if numbers within an array follow an arithmetic or geometric sequence.
For this challenge you will determine if numbers in an array can add up to a certain number in the array.
For this challenge you will be converting a number from binary to decimal.
For this challenge you will determine which word has the greatest number of repeated letters.
For this challenge you will transform a string using the Caesar Cipher.
For this challenge you will determine the mode, the number that appears most frequently, in an array.
For this challenge you will determine how to order an array of numbers consecutively.
For this challenge you will divide two numbers and print them in a certain format.
For this challenge you will return the total number of minutes between two times.
For this challenge you will determine the next greatest number using the same numbers of a given argument.
For this challenge you will determine if you can arrange a number to be a prime number.
For this challenge you will be manipulating a string using dashes (-).
For this challenge you will be manipulating numbers in a string based on the characters.
For this challenge you will traverse a string searching for all the numbers and then you will add them up.
For this challenge you will determine if there is a number that appears consecutively in both arguments.
For this challenge you will determine if the brackets in a string are correctly matched up.
For this challenge you will manipulate a string of characters using a simple reduction method.
For this challenge you will be determining the multiples of a specific number.
For this challenge you will be determining the smallest combination of coins for a given output
For this challenge you will be determining whether a number is part of the Fibonacci sequence.
For this challenge you will determine if all the brackets in a string are correctly matched up.
For this challenge you will determine what period of the day gives the most free time.
For this challenge you will be determining the areas of rectangles.
For this challenge you will determine the next number in a sequence.
For this challenge you will remove duplicate elements from an array.
For this challenge you will encode a given string following a specific rule.

Hard Difficulty

For this challenge you will be optimally assigning tasks to a number of machines.
For this challenge you will determine whether or not a matrix is transitive.
For this challenge you will have to determine the shortest path from one node to an end node.
For this challenge you will be evaluating a mathematical expression within a string.
For this challenge you will be given a string and you will have to determine whether some sort of pattern exists.
For this challenge you will have to determine the shortest weighted path from one node to an end node.
For this challenge you will be determining where two lines intersect in terms of Cartesian coordinates.
For this challenge you will determine whether a given set of vertices form a Hamiltonian path on the graph.
For this challenge you will be determining whether a car can get around a route with a limited amount of gas.
For this challenge you will determine how quickly you can sort an array based on a specific sorting technique.
For this challenge you will be determining the winning position of a Tic-tac-toe board.
For this challenge you will be determining the highest cards within a hand in Blackjack.
For this challenge you will be decoding a message.
For this challenge you will determine whether a given set of vertices can cover all the edges in the graph.
This challenge will require knowledge of chess pieces and their movements.
For this challenge you will determine what nodes are farthest apart.
This challenge will require knowledge of postfix notation for arithmetic expressions.

This challenge will require knowledge of the Gaussian elimination process to produce a RREF matrix.
For this challenge you will determine whether a matrix is symmetric or not.
For this challenge you will calculate the determinant of a square matrix.
This challenge will require knowledge of chess pieces and their movements.

Member Challenges

For this challenge you will be checking if a Sudoku board is legal.
For this challenge you will determine when a specific sequence terminates.
For this challenge you will determine how many different ways you can walk up a flight of stairs.
For this challenge you will be determining how to order people in a line.
This challenge will require knowledge of chess pieces and their movements.
For this challenge you will be determining squares of certain numbers.
For this challenge you will be determining the winner of a Connect Four game.
For this challenge you will determine how many times you can jump around within an array.
For this challenge you will be transposing rows and columns within an array.
For this challenge you will be reducing a string of roman numerals.
For this challenge you will determine how to properly split an array into two sets.
For this challenge you will be determining the longest common subsequence of two strings.
For this challenge you will determine the winner of a Nim game.
For this challenge you will determine the next number in a row from Pascal's triangle.
For this challenge you will determine whether or not a heap is a max heap.
This challenge will require knowledge of basic mathematical combinations.
This challenge will require knowledge of basic mathematical combinations.
This challenge will require knowledge of calculating the Fibonacci numbers.
This challenge will require knowledge of basic Boolean logic.