Sha256: 7c07b9764f25ea8525fc22cad6e934ad755b35a4e2147c5dc2ede7a75829a954
Contents?: true
Size: 1.52 KB
Versions: 75
Compression:
Stored size: 1.52 KB
Contents
# Largest Series Product Given a string of digits, calculate the largest product for a contiguous substring of digits of length n. For example, for the input `'1027839564'`, the largest product for a series of 3 digits is 270 (9 * 5 * 6), and the largest product for a series of 5 digits is 7560 (7 * 8 * 3 * 9 * 5). Note that these series are only required to occupy *adjacent positions* in the input; the digits need not be *numerically consecutive*. For the input `'73167176531330624919225119674426574742355349194934'`, the largest product for a series of 6 digits is 23520. ## Setup There are two different methods of getting set up to run the tests with Objective-C: - Create an Xcode project with a test target which will run the tests. - Use the ruby gem `objc` as a test runner utility. Both are described in more detail here: http://exercism.io/languages/objective-c ### Submitting Exercises When submitting an exercise, make sure your solution file is in the same directory as the test code. The submit command will look something like: ```shell exercism submit <path-to-exercism-workspace>/objective-c/largest-series-product/LargestSeriesProduct.m ``` You can find the Exercism workspace by running `exercism debug` and looking for the line beginning with Workspace. ## Source A variation on Problem 8 at Project Euler [http://projecteuler.net/problem=8](http://projecteuler.net/problem=8) ## Submitting Incomplete Solutions It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
75 entries across 75 versions & 1 rubygems