{"request":{"endpoint":"https://exercism.org/api/v2/tracks/cpp/exercises/parallel-letter-frequency/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"d4005f82dded4e96b5227a5d8b1bd81d","snippet":"namespace parallel_letter_frequency { std::unordered_map sharedMap; std::mutex mapMutex; void get_frequency(std::basic_string_view str) { std::lock_guard lock(mapMutex); for (char c : str) { if (std::isalpha(c)) { c = std::tolower(c); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":8,"num_iterations":1,"num_loc":41,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-03-18T20:52:29.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"breir"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/breir","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"151762b4ce2940fba8c007a108bd0fed","snippet":"namespace parallel_letter_frequency { namespace { counter combine(counter c1, counter c2) { counter comb; comb.merge(c1); for (auto &[c, x]: c2) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":52,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-05-22T07:12:31.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"alterpatzer"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/alterpatzer","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"026ff13a70ee472cb1313b8c2fa985d2","snippet":"namespace parallel_letter_frequency { std::unordered_map frequency(const std::vector& texts) { std::unordered_map result; std::mutex result_mutex; const auto count = [&result, &result_mutex](std::string_view text) { std::unordered_map local_result; for (char c : text) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":37,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-06-11T15:07:06.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"zFGroup"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/zFGroup","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"c25c74368d264d7a95bde7a442beb471","snippet":"namespace parallel_letter_frequency { inline std::map frequency(const std::vector& input_strings) { std::vector> futures; futures.reserve(input_strings.size()); for (const auto& input_string : input_strings) { futures.emplace_back(std::async(std::launch::async, [&input_string] { internal_map_type result(26, 0); for (const auto& c : input_string) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":37,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-06-23T22:15:59.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"ingomen"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/ingomen","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"d492c93d5a3a4d9f89ba7202b5db45d3","snippet":"namespace parallel_letter_frequency { std::vector generate_alphabet() { std::string alphabet(26, ' '); std::iota(alphabet.begin(), alphabet.end(), 'a'); const std::vector data(alphabet.begin(), alphabet.end()); return data; } std::map frequency(const std::vector &text) { std::vector alphabet = generate_alphabet(); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":34,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-05-29T11:08:07.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"veritacodex"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/veritacodex","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"f073dabc78424b43842580f8e9f73806","snippet":"namespace parallel_letter_frequency { constexpr bool basicIsAlpha(char c) { return (c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z'); } bool AlphaMap::empty() { for (auto num : map) { if (num != 0) return false; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":59,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-08-19T17:58:29.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"Joseph-Ladino"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/Joseph-Ladino","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"cbecc24eb05a4819b6110722455b5df3","snippet":"namespace parallel_letter_frequency { unordered_map frequency(const vector& v) { mutex mtx; unordered_map m; auto process = [&](const string_view& s) { for (const char& c : s) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":40,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-01-21T04:21:41.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"dcsdmir"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/dcsdmir","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"da6eeb86cba34c51b2814d263fb0ffc5","snippet":"static std::map& wordToMapReducer( std::map& m, char c ){ if( std::isalpha( c ) ){ c = std::tolower( c ); m[c] = ( m.end() == m.find( c ) ) ? 1 : m[c] + 1; } return m; } static std::map wordToMap( std::string_view t ){ return std::accumulate( t.begin(), t.end(), std::map(), wordToMapReducer ); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":34,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-01-12T19:16:21.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"MooneshLutchman"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/MooneshLutchman","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"4af7e6a6bdf64d668064b9003b877a8a","snippet":"namespace parallel_letter_frequency { std::unordered_map frequency_string(std::string_view text) { std::unordered_map freq; for (char c : text) { if (std::isalpha(c)) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":47,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-09-23T06:36:01.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"colinmcnicholl"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/colinmcnicholl","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"dd1e7c7de62041d594bea5df300dc769","snippet":"namespace parallel_letter_frequency { std::map frequency(const std::vector& strings) { std::array, 26> temp{0}; std::for_each( strings.cbegin(), strings.cend(), [&temp](const auto& s) { for (const auto c: s) { ++temp[tolower(c) - 'a']; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":32,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-12-04T10:05:30.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"chillefeld"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/chillefeld","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"e8a03d5d5f9c46e8853d4fbb50d356aa","snippet":"namespace { std::unordered_map result{}; std::mutex map_mutex; void count(std::string_view str) { std::unordered_map thread_result; for (const auto c : str) if (std::isalpha(c)) thread_result[std::tolower(c)]++; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":39,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-07T10:59:18.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"ihctb"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/ihctb","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"ea16b1d6b1e94c99a82c8f8705f09d7a","snippet":"namespace parallel_letter_frequency { std::unordered_map frequency( const std::vector &strings) { std::mutex m; std::unordered_map freqs{}; std::for_each( std::execution::par, std::begin(strings), ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":43,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-04-02T17:28:10.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"Skyb0rg007"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/Skyb0rg007","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"c29e71b34f414ab288e9c7d5a343b6a0","snippet":"namespace parallel_letter_frequency{ std::map frequency( std::vector const texts ) { std::map result {}; for (const std::string_view& str : texts) { for( char targetChar : str ){ if( result[std::tolower(targetChar)] != 0 ) continue; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":30,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2024-03-02T22:10:00.000Z","is_out_of_date":true,"language":"cpp","author":{"handle":"tiagomendes7"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/tiagomendes7","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"f969b121962c42d4a31f857d20a91810","snippet":"namespace parallel_letter_frequency { auto merge(unmap& aFirst, const unmap& aSecond) -> void { for(auto [ch, count] : aSecond) aFirst[ch] += count; } auto charCount(std::string_view aWord) -> unmap ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":47,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-04-05T15:19:37.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"denisss"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/denisss","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"e87c8a67c04d4011bf796e5cb61b13d8","snippet":"namespace parallel_letter_frequency { struct shared_map { map m_map; mutex m_mutex; }; void freq_thread(string_view s, shared_map* sm) { map m; for (char c: s) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":65,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-04-07T22:03:00.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"elhoward"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/elhoward","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"bf7f03b546a346838f75144c45f62ad3","snippet":"","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-07-15T16:11:53.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"wilbur01"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/wilbur01","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"a098f0096c1b445daa3822e6c5a36cd0","snippet":"namespace parallel_letter_frequency { frequency_map frequency(const std::vector& texts) { std::vector threads; std::vector local_maps(texts.size()); for (size_t i = 0; i < texts.size(); ++i) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":45,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-07-29T11:29:07.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"Izxy"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/Izxy","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"27ba7c8c932c4c7e958f04564e337096","snippet":"namespace parallel_letter_frequency { std::unordered_map counter; std::mutex counter_mutex; void tally_chars(std::basic_string_view input_segment) { std::lock_guard guard(counter_mutex); for (char symbol : input_segment) { if (std::isalpha(symbol)) { symbol = std::tolower(symbol); ++counter[symbol]; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":41,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-07-29T18:35:47.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"Rohankapri"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/Rohankapri","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"68b2b878a3a04146a7d210528604a47d","snippet":"namespace parallel_letter_frequency { frequency_map frequency(const std::vector& texts) { std::vector partials(texts.size()); std::for_each(std::execution::par, texts.begin(), texts.end(), [&partials, begin = texts.data()](const std::string_view& text) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":40,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-07-29T18:39:04.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"Leonod33"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/Leonod33","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"34706d6614d04e1f88a694adf793546c","snippet":"namespace parallel_letter_frequency { unordered_map frequency(std::vector txts) { unordered_map ret{}; for (const auto txt : txts) { for (const auto c : txt) { if (isalpha(c)) { ret[tolower(c)]++; } } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-06-14T06:43:30.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"pappurohit99"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/pappurohit99","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"15a70e95dc274371ab350ca8c6944428","snippet":"namespace parallel_letter_frequency { constexpr size_t ALPHABET_LENGTH = 26; size_t letter_index(char letter); char letter_from_index(size_t index); class LetterCounter { public: /// @brief Merges multiple counters into one ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":91,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-03-06T17:52:51.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"dev-diego-fully"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/dev-diego-fully","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"890b562b2a5349fd854b7916bdec9945","snippet":"namespace parallel_letter_frequency { std::map frequency(const std::vector &texts) { std::mutex map_mutex; std::map letter_counts; std::for_each(std::execution::par, texts.begin(), texts.end(), [&](std::string_view text) { for (char c : text) { if (std::isalpha(c)) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-05-30T10:16:24.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"theflyoccultist"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/theflyoccultist","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"ca17ba95404c426788f45ba06ffb58bc","snippet":"namespace parallel_letter_frequency { void process_range(std::array &local_freq, const std::vector &texts, const std::size_t begin, const std::size_t end ) { for (std::size_t i = begin; i < end; ++i) { for (const char letter: texts[i]) { const auto c = static_cast(letter); if (std::isalpha(c)) { ++local_freq[std::tolower(c) - 'a']; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":69,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-06-01T04:05:32.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"EduardoMaravilla"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/EduardoMaravilla","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}},{"uuid":"9714ee152b3c411dbddb675dbfcc97bb","snippet":"namespace parallel_letter_frequency { std::map frequency(const std::vector &texts) { auto counts = std::transform_reduce( std::execution::par, texts.begin(), texts.end(), std::array{}, [](const std::array &a, const std::array &b) { std::array result{}; for (int i = 0; i < 26; ++i) { result[i] = a[i] + b[i]; } return result; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":42,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-06-23T02:44:44.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"jaxlib"},"exercise":{"title":"Fréquence des lettres en parallèle","icon_url":"https://assets.exercism.org/exercises/parallel-letter-frequency.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/solutions/jaxlib","private_iterations_url":"https://exercism.org/fr/tracks/cpp/exercises/parallel-letter-frequency/iterations"}}],"meta":{"current_page":1,"total_count":124,"total_pages":6,"unscoped_total":124}}}}}

Parcours de langages

Apprends à coder avec Jiki

Ton voyage

Tes favorisNouveau

Avantages Exercism

Vidéos de la communauté

Série de brèves introductions

Interviews et récits

Discord

Forum

Premiers pas

Mentorat

Documentation

Contributeurs

TraducteursNouveau

Faire un don

À propos d'Exercism

Notre impact

GitHub SyncerNouveau

Insiders