Import and compile the library.
void LoadNumBestN_of_a_Kind(int arr, int bufferset, int buffernum)
//Searches array for sets of the same king=d and reports result into two buffer array
// arr -> Array to search
// Bufferset -> kinds of found sets, in order of iteration i. e. set of 2s, then set of 3s, then set of 4s.
// Buffernum -> sizes of found sets, in order of iteration i. e. pair, then quad, then triplet
// For example inputing {2,4,4,2,2,4,2,3,3} will load {2,4,3} into buffernum and {4,3,2} into bufferset, as there are 4 2`s, 3 4`s and 2 3`s in input array.
int GetNumSets(int arr, int minnum, int maxnum)
//Returns number of sets in given array that are between minimum and maximum sizes, if limits are specified (>0) For instance, array {4,4,4,6,6} with maxnum =2 will return only 1, despite it being full house and it contains two pairs, if one of 4s is gone.
int GetBestSequence(int arr)
//Returns number of longest stright sequence in array. For instance, {1,4,5,2,4,3} will return 5, as you can find 5 consecutive numbers in input array.
bool IsNoaKind(int arr, int numtarget, bool exact, bool allowothersets, int color)
//Returns true, if longest set of same kind in the given array is at least "numtarget" long, or exactly long, if "exact" is true. "allowothersets", if set to true, causes function to return false, if there are other sets in input array, besides the target set. "Color" restricts target set to be specific number, i,e 3 6s.
bool IsMultiFullHouse(int arr, int maxset, int minset, bool exact)
//Returns true, if all alements of array are a part of sets that are within minimum and maximum limits, if set(>0). If "exact" boolean is set to true, the array must in addition contain set of specific limit, i. e. if max set size is set to 4 and min is set to 3, the array must contain at least 1 triplet and 1 quad. If that array does not have target sets of specific size, or contains set that exceeds specified limit, i,e 5 of a kind, the function will return false.
