Require Mathematician For Advanced JavaScript Function.
Budget: $10 – $60 AUD
I require the following task to be completed:
STEP ONE: TAKE TWO ARGUMENTS; INPUT AND INDEX.
if INDEX is undefined; then do the following:
CALCULATE (DO NOT USE BRUTEFORCE); the alphabetically sorted set of the string in order of all its variances index and store the index.
STEP TWO: Find the string with the most repititions.
Return the index and string with most repitions.
If INDEX is defined; then do the following.
CREATE THE STRING FROM THE ENCRYPTED STRING AND INDEX.
Return the original String,.
Please only post a quote if you are capable of doing this job!
Sorry I can only pay $50 AUD!
STEP ONE: TAKE TWO ARGUMENTS; INPUT AND INDEX.
if INDEX is undefined; then do the following:
CALCULATE (DO NOT USE BRUTEFORCE); the alphabetically sorted set of the string in order of all its variances index and store the index.
STEP TWO: Find the string with the most repititions.
Return the index and string with most repitions.
If INDEX is defined; then do the following.
CREATE THE STRING FROM THE ENCRYPTED STRING AND INDEX.
Return the original String,.
Please only post a quote if you are capable of doing this job!
Sorry I can only pay $50 AUD!