Problem

Genome Sequence 001: Introductory DNA Sequencing
This Challenge series will evolve the complexity of Genome DNA Sequencing. <http://en.wikipedia.org/wiki/Genome DNA Sequencing> ...

14 years ago | 1 | 8 solvers

Problem

Unique: Enhanced Performance - Avoiding Memory Crash
The Challenge is to create the unique array for a long and wide array. Difficulties are that the normal unique(a,'rows') func...

14 years ago | 1 | 16 solvers

Problem

Unique: Enhanced Performance - Large and Wide Array - Speed Improvement (66% savings)
The Challenge is to perform very fast unique function for a long and wide array. The data is small integer representing data ...

14 years ago | 0 | 21 solvers

Problem

ismember: Enhanced Time Performance for 'rows' - Speed Scoring (90% savings)
The Challenge is to perform very fast the 'ismember' function for a long and wide array. The data is small integer representi...

14 years ago | 0 | 21 solvers

Problem

ismember: Enhanced Performance for 'rows' and width - Speed Scoring (66% savings)
The Challenge is to perform very fast the 'ismember' function for a long and wide array. The width of the array is expanded fro...

14 years ago | 0 | 22 solvers

Solved

14 years ago

Solved

14 years ago

Solved

14 years ago

Solved

Pi Estimate 2
Estimate Pi as described in the following link: <http://www.people.virginia.edu/~teh1m/cody/Pi_estimation2.pdf>

14 years ago

Solved

Pi Estimate 1
Estimate Pi as described in the following link: <http://www.people.virginia.edu/~teh1m/cody/Pi_estimation1.pdf>

14 years ago

Solved

Unique: Enhanced Performance - Avoiding Memory Crash
The Challenge is to create the unique array for a long and wide array. Difficulties are that the normal unique(a,'rows') func...

14 years ago

Problem

Unique: Faster for options 'rows' and 'stable' for large array of uint8
Challenge: Execute unique(a,'rows','stable') Faster for 'a' being uint8. The "unique" function for the 'rows' and 'stable' o...

14 years ago | 0 | 25 solvers

Problem

Unique: Faster 'rows' for large array of uint8
Challenge: Execute unique(a,'rows') Faster for 'a' being uint8. The "unique" function for the 'rows' options may be performe...

14 years ago | 0 | 25 solvers

Solved

Unique: Faster for options 'rows' and 'stable' for large array of uint8
Challenge: Execute unique(a,'rows','stable') Faster for 'a' being uint8. The "unique" function for the 'rows' and 'stable' o...

14 years ago

Problem

Cody Matlab Version
What is the current Cody Matlab Release? *Output:* string *Examples:* '(R2012a)' or 'R2012a' Hint: We have mo...

14 years ago | 0 | 176 solvers

Solved

Cody Matlab Version
What is the current Cody Matlab Release? *Output:* string *Examples:* '(R2012a)' or 'R2012a' Hint: We have mo...

14 years ago

Solved

"mirror" matrix
Create n x 2n "mirror" matrix of this type: e.g. for n = 2 m = [1 2 2 1;1 2 2 1] e.g. for n = 3 m = [1 2 3 3 2 1...

14 years ago

Solved

Find the repeating decimal pattern!
Write a function that takes one double input value and returns only the repeating decimal, if any, as a string. Only decimals f...

14 years ago

Solved

Functionality 1
It's all about functionality. *Cheating is allowed but not required*

14 years ago

Solved

R2012b atan in Degrees
Return in degrees the atan result of inputs for all four quadrants. *Examples:* [x, y] Degrees 1 0 0 1 1 ...

14 years ago

Problem

DNA Pattern Match: Performance Metric - Speed
The Challenge is to Rapidly find matches of DNA sequences, Length=6, in a 1,800,000 long DNA file. At <http://imacst.com/issu...

14 years ago | 1 | 10 solvers

Solved

DNA Pattern Match: Performance Metric - Speed
The Challenge is to Rapidly find matches of DNA sequences, Length=6, in a 1,800,000 long DNA file. At <http://imacst.com/issu...

14 years ago

Problem

Rubik's Mini Cube: Solve Randomized Cube in 11 Moves or Less; Score is by Time (msec)
The Challenge is to Near or Optimally Solve a thoroughly scrambled Mini-Rubik's Cube(2x2x2). Any Mini-Cube can be solved in 1...

14 years ago | 5 | 3 solvers

Solved

Ordinal numbers
Given an integer n, return the corresponding ordinal number as a character string. For example, ord(1)='1st' ord(2)=...

14 years ago

Problem

Find: Faster Alternatives for Large Sorted/Unique Vectors
The Challenge is to create faster Find methods for large unique ascending vectors. Methods exist that are 1000 times faster t...

14 years ago | 3 | 38 solvers

Solved

Find: Faster Alternatives for Large Sorted/Unique Vectors
The Challenge is to create faster Find methods for large unique ascending vectors. Methods exist that are 1000 times faster t...

14 years ago

Problem

Rubik's Mini-Cube: Solve Randomized Mini-Cube - Score : Moves
The Challenge is to Solve a thoroughly scrambled Mini-Rubik's Cube(2x2x2). The Performance metric is average number of moves ...

14 years ago | 1 | 4 solvers

Problem

Rubik's Cube: Solve Randomized Cube - Score : Moves
The Challenge is to Solve a thoroughly scrambled Rubik's Cube. The Performance metric is average number of moves for solving ...

14 years ago | 0 | 2 solvers

Problem

New Cody Time-Out Time
Determine the New Cody Time-Out Time Consume the Maximum Possible Time without Timing out. *Score:* 60 (sec) - Time (sec) ...

14 years ago | 0 | 36 solvers

Solved

New Cody Time-Out Time
Determine the New Cody Time-Out Time Consume the Maximum Possible Time without Timing out. *Score:* 60 (sec) - Time (sec) ...

14 years ago