{"request":{"endpoint":"https://exercism.org/api/v2/tracks/haskell/exercises/palindrome-products/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"9b5c6f013b924ac391519b9b6d35aa6c","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where type Factors = (Integer, Integer) data Direction = Down | Up deriving (Eq) twoFactor :: Integer -> Integer -> Integer -> [Factors] twoFactor d most n | n < d * d = [] | r == 0 && q <= most = (d, q) : twoFactor (d + 1) most n ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":50,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-01-08T00:15:03.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"alterpatzer"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/alterpatzer","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"8a6a2603d7b2415db6b7b5a8ad421158","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where import Control.Monad (guard) type FactorPair = (Integer, Integer) type Palindrome = Integer largestPalindrome :: Integer -> Integer -> Maybe (Palindrome, [FactorPair]) largestPalindrome minFactor maxFactor = findFirstValid minFactor maxFactor descPalindromes where ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":49,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-11-29T13:11:31.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"ktoth"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/ktoth","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"4d651686e1154a7c8a9859eefedaed23","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where import Data.List(sortOn) largestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) largestPalindrome minFactor maxFactor = safeHead. reverse $ palindromes minFactor maxFactor smallestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) smallestPalindrome minFactor maxFactor = safeHead $ palindromes minFactor maxFactor ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-02-19T03:48:07.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"cgs041328"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/cgs041328","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"e3278bd1191f40b8a3ea1b8f24ca8e39","snippet":"{-# LANGUAGE TupleSections #-} module Palindromes (largestPalindrome, smallestPalindrome) where import Data.Function (on) import Data.List (sortBy) import Data.Monoid largestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) largestPalindrome minFactor maxFactor = case s of ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-03-19T08:12:14.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"chenyulue"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/chenyulue","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"beec76ea0fdf4ad797677480d388c929","snippet":"module Palindromes ( largestPalindrome , smallestPalindrome ) where import Data.List factors :: Integral a => a -> [a] factors n = [i | i <- [1 .. n], mod n i == 0] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":41,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2019-06-11T10:38:14.000Z","is_out_of_date":true,"language":"haskell","author":{"handle":"tetrapharmakon"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/tetrapharmakon","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"4600b788894845ea9a8f904338f63b6d","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where largestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) largestPalindrome minFactor maxFactor = if null palList then Nothing else Just (maxVal, [(a,maxVal `div` a) | (_,a) <- factor]) where ls = listProduct [minFactor..maxFactor] palList = filter (isPalindrome . fst) ls maxVal = foldl (\x -> \y -> max x (fst y)) 1 palList factor = filter ((maxVal == ). fst) palList ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":21,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2021-07-04T12:08:17.000Z","is_out_of_date":true,"language":"haskell","author":{"handle":"timliao0206"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/timliao0206","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"ee6c77ebdd93427682ae8f157f935889","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where largestPalindrome :: Integer -> Integer -> Maybe (Integer,[(Integer,Integer)]) largestPalindrome l h | plist == [] = Nothing | otherwise = Just (maxPal, filter (\(x,y) -> (x*y) == maxPal) plist) where plist = filter (\(x,y) -> isPalindrome (x*y)) [ (x,y) | x <- [l..h], y <- [x..h] ] maxPal = maximum . map (\(x,y) -> (x*y)) $ plist smallestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2021-01-13T00:12:20.000Z","is_out_of_date":true,"language":"haskell","author":{"handle":"cburdine"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/cburdine","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"325895284f1b4eb88981ef8fd049c37e","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where import Data.Maybe (listToMaybe) smallestPalindrome :: Int -> Int -> Maybe (Int, [(Int, Int)]) smallestPalindrome begin end = listToMaybe pal where pal = take 1 $ filter (\(p, fs) -> isPalindromeNum p && fs /= []) $ map factor range range = [begin * begin .. end * end] factor p = (p, factorize begin end p) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":35,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-06-11T21:51:21.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"0x28"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/0x28","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"b4ee3eca2f8a485c93471a7dca987f4d","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where type Factors = [(Integer, Integer)] type Result = (Integer, Factors) largestPalindrome :: Integer -> Integer -> Maybe Result largestPalindrome minFactor maxFactor | minFactor <= maxFactor = first $ palindromeFactors maxFactor minFactor (-1) | otherwise = Nothing ","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":"2022-05-27T18:00:05.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"emiliolg"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/emiliolg","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"ea826fc288854643a5cea18ba921817b","snippet":"module Palindromes where import Data.Maybe ( listToMaybe ) smallestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) smallestPalindrome mn mx = searchPalindrome (takeWhile (<=mx*mx) . dropWhile ( Integer -> Maybe (Integer, [(Integer, Integer)]) largestPalindrome mn mx = searchPalindrome (takeWhile (>=mn*mn) . dropWhile (>mx*mx) . reverse) mn mx ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":5,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-11-16T20:32:59.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"MonsieurOrnix"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/MonsieurOrnix","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"6ca528ec1377464d87a2147bfb5a09b6","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where import Control.Monad (liftM2) import Data.List (groupBy, sortBy) import Data.List.NonEmpty (head, last, nonEmpty) import Data.Ord (comparing) import Prelude hiding (head, last) type PalindromeFactors = (Integer, [(Integer, Integer)]) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":21,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2021-09-17T23:27:36.000Z","is_out_of_date":true,"language":"haskell","author":{"handle":"MisterPeModder"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/MisterPeModder","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"890e2dd0c9c34bcab151c715488ab420","snippet":"module Palindromes (largestPalindrome, smallestPalindrome, isPalindrome) where largestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) largestPalindrome mini maxi = palindrome id range maxi where range x = [x, x -1 .. mini] smallestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) smallestPalindrome mini maxi = palindrome flip range mini where ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":35,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-10T03:49:38.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"okamotonr"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/okamotonr","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"38b5eb9f464c497fa7755078c9b3a72a","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where import Data.List (find, unfoldr) largestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) largestPalindrome minFactor maxFactor | minFactor > maxFactor = Nothing | otherwise = (\p -> (p, numberToFactorPairs p minFactor maxFactor)) <$> find isAppropriate [upperLimit, upperLimit -1 .. lowerLimit] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":5,"num_loc":37,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-06-22T15:14:33.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"wsgac"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/wsgac","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"d173579804c0441db80a8e35086d697a","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where import Data.Foldable (find) isPalindrome :: Integer -> Bool isPalindrome n = let str = show n in str == reverse str largestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) largestPalindrome = helper Nothing where helper :: Maybe (Integer, [(Integer, Integer)]) -> Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) helper Nothing minF maxF ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-02-16T15:29:17.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"twrch-trwyth"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/twrch-trwyth","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"3ada12beab2c433f81260b782ca4d4fe","snippet":"{-# LANGUAGE BangPatterns #-} module Palindromes (largestPalindrome, smallestPalindrome) where import Control.Arrow ((<<<)) import Control.Monad (guard) import Data.Ix (range) import Data.List (foldl') import Data.List.NonEmpty (nonEmpty, NonEmpty(..)) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":44,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-08-29T08:12:05.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"hauleth"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/hauleth","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"9f4426af58ba45bc8472e82806383c42","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where import Data.List (sortOn) largestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) largestPalindrome minFactor maxFactor = safeHead . reverse $ palindromes minFactor maxFactor smallestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) smallestPalindrome minFactor maxFactor = safeHead $ palindromes minFactor maxFactor palindromes minFactor maxFactor = sortOn fst [(c, (a, b)) | a <- [minFactor .. maxFactor], b <- [a .. maxFactor], let c = a*b, isPalindrome c] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":6,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-12-26T04:44:16.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"lala7573"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/lala7573","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"ced8e74e565e4f188d21326fc26117ac","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where import Data.Maybe (catMaybes, listToMaybe) toDigits :: Integer -> [Integer] toDigits 0 = [] toDigits n = let (n', d) = divMod n 10 in d : toDigits n' fromDigits :: [Integer] -> Integer fromDigits = sum . zipWith (*) (iterate (*10) 1) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":48,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-10-25T10:21:53.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"gozzarda"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/gozzarda","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"9be3866d4d814d5ca6a3538fb56add6a","snippet":"{-# LANGUAGE ScopedTypeVariables #-} {-# LANGUAGE InstanceSigs #-} module Palindromes (largestPalindrome, smallestPalindrome) where import Data.Function ( on ) import Data.Set ( Set ) import qualified Data.Set as S import Prelude hiding (min, max) data Prod = Prod Integer Integer deriving (Eq, Show) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":6,"num_loc":42,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-12-01T11:02:41.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"MC-STRASZNY-GRACZ"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/MC-STRASZNY-GRACZ","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"f0f6bb6e23834f21939a9c32964de1ee","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where largestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) largestPalindrome minFactor maxFactor = foldr compareProduct Nothing $ palindromeProducts minFactor maxFactor where compareProduct something Nothing = Just something ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":33,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-10-26T22:21:35.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"dfacoet"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/dfacoet","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"c6aa6104473f4d72b19351b9f64b910b","snippet":"{-# LANGUAGE GADTs #-} {-# LANGUAGE TypeApplications #-} module Palindromes (largestPalindrome, smallestPalindrome) where import Control.Arrow ((<<<)) import Control.Monad (guard) factorizeInRange :: Integral a => (a, a) -> a -> [(a, a)] factorizeInRange (low, high) n ","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":"2025-10-19T18:30:59.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"DCPagan"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/DCPagan","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"3e190d220ff4417b83a09315185e4f71","snippet":"module Palindromes ( largestPalindrome, smallestPalindrome, ) where largestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) largestPalindrome minFactor maxFactor = case mp of Just mp' -> sequence (mp', fmp) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":35,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-05T16:10:15.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"bigos"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/bigos","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"ae22dc159d1e4070868e19dc816f704b","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where import Data.List ( sortOn ) largestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) largestPalindrome minFactor maxFactor = case allPalindromes minFactor maxFactor of [] -> Nothing ps -> Just $ ( largest, concatMap snd $ filter (\p -> fst p == largest) ps ) where largest = fst (last ps) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-03-05T01:49:11.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"iamemhn"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/iamemhn","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"59bc97f892774461ae53c6b025ddaa11","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where import Data.Map.Strict (fromListWith, Map, toDescList, toAscList) import Data.Maybe (listToMaybe) largestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) largestPalindrome minFactor maxFactor = listToMaybe $ toDescList $ products minFactor maxFactor smallestPalindrome :: Integer -> Integer -> Maybe (Integer, [(Integer, Integer)]) smallestPalindrome minFactor maxFactor = listToMaybe $ toAscList $ products minFactor maxFactor ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-05-09T19:59:41.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"tobeannouncd"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/tobeannouncd","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}},{"uuid":"3852e458cab2476283a2c332951cde99","snippet":"module Palindromes (largestPalindrome, smallestPalindrome) where import Data.List (nub, sort) isPalindrome :: Integer -> Bool isPalindrome n = let s = show n in s == reverse s palindromeProducts :: Integer -> Integer -> [(Integer, (Integer, Integer))] palindromeProducts minF maxF = [ (p, (a, b)) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":32,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":null,"is_out_of_date":false,"language":"haskell","author":{"handle":"axelsavero"},"exercise":{"title":"Παλίνδρομα γινόμενα","icon_url":"https://assets.exercism.org/exercises/palindrome-products.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/solutions/axelsavero","private_iterations_url":"https://exercism.org/el/tracks/haskell/exercises/palindrome-products/iterations"}}],"meta":{"current_page":1,"total_count":88,"total_pages":4,"unscoped_total":88}}}}}

Γλώσσες προγραμματισμού

Μάθε προγραμματισμό με το Jiki

Το Ταξίδι σου

Τα Αγαπημένα σουΝέο

Προνόμια του Exercism

Βίντεο της Κοινότητας

Σειρά σύντομων εισαγωγών

Συνεντεύξεις και ιστορίες

Discord

Φόρουμ

Ξεκινώντας

Καθοδήγηση

Τεκμηρίωση

Συνεισφέροντες

ΜεταφραστέςΝέο

Κάνε δωρεά

Σχετικά με το Exercism

Ο αντίκτυπός μας

Συγχρονισμός GitHubΝέο

Insiders