Largest Series Product

Ringkasan Tantangan

Given a string of digits, calculate the largest product for a contiguous substring of digits of length n.

Visit the largest-series-product exercise on Exercism to read the full instructions and download the exercise files.

Community Solutions

Lihat Solusi Komunitas

The following are the top 3 community solutions by stars:

Solution 1 by @shikov (⭐ 1) — View on Exercism
Solution 2 by @Jadilathish (⭐ 0) — View on Exercism
Solution 3 by @Akash2802 (⭐ 0) — View on Exercism

Source: Exercism c/largest-series-product

💡 Lihat Solusi

#include "largest_series_product.h"
#include <string.h>
#include <ctype.h>

int64_t largest_series_product(char* series, size_t size){
    if(size>strlen(series)) return -1;
    int64_t largest = 0;
    for (size_t i=0; i<strlen(series)-size+1; i++) {
        int64_t product = 1;
        for (size_t j=i; j<i+size; j++) {