Solution 11 by Alfonso crushes Java performance with a time of 0.014s for 1000!. Best use of base.
longer code but considerably faster non-java solution (0.05s for 1000!)
Solution 9 sees Alfonso step up and provide a concise method in the Best Factorial Solution in the Non-Java Category.
We don't need no steenkin' Java. :-)
Solution 6 is an expertly crafted non-java solution. Complexity Level- Outstanding. Time for 1000! vs Java ?
The convolution method is considerably slower than Java, which is what you would expect. For the java vs. non-java solutions:
Java - Elapsed time is 0.138064 seconds.
This case - Elapsed time is 1.039240 seconds.
Given two strings, find the maximum overlap
Project Euler: Problem 6, Natural numbers, squares and sums.
Stuff the Board
Generate binary combinations for a given number of bit(s)
Dimensions of a rectangle
GJam 2017 Kickstart: Leader (Small)
PACMAT 08 - Awesome Tunneling Ghosts, 2X Speed, 6 Lives, Game Download
Make a Pandiagonal Prime Magic Square: 11 x 11
Tiles Contest: Perfect Solutions for Large Unique Tile Boards
Text File Read: 64 bit data set
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office