{"request":{"endpoint":"https://exercism.org/api/v2/tracks/haskell/exercises/saddle-points/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"b3a6aad0d37f49c8a67c9b1a5f99b5bd","snippet":"module Matrix (saddlePoints) where import Data.Array (Array) import qualified Data.Array as A import qualified Data.Ix as I type Point = (Int, Int) saddlePoints :: (Ord e) => Array Point e -> [Point] saddlePoints matrix = filter isSaddlePoint (A.indices matrix) ","num_views":0,"num_stars":2,"num_comments":2,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Ninjani"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/Ninjani","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"1e2cc879dd824554a4cfc78743d6387b","snippet":"module Matrix (saddlePoints) where import Data.Array ( Array, (!), bounds ) type Index = (Int, Int) saddlePoints :: Array Index Int -> [Index] saddlePoints matrix = [ (row, col) | row <- [minRow..maxRow] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-16T17:05:44.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Krogh33"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/Krogh33","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"74f341142cf24a43a9660debdd4a5a45","snippet":"module Matrix (saddlePoints) where import Data.Array saddlePoints :: (Ord e) => Array (Int, Int) e -> [(Int, Int)] saddlePoints matrix = [ (r,c) | r <- [rMin..rMax] , c <- [cMin..cMax] , let val = matrix ! (r,c) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":15,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-02-25T16:57:30.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"zaira11"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/zaira11","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"519ca1d11812445b8644b21f6313ac57","snippet":"module Matrix (saddlePoints) where import Data.Array (Array, (!), bounds) saddlePoints :: Array (Int, Int) Int -> [(Int, Int)] saddlePoints xm = filter isSaddlePoint [ (row, col) | row <- [rowL..rowH], col <- [colL..colH] ] where ((rowL, colL), (rowH, colH)) = bounds xm isSaddlePoint :: (Int, Int) -> Bool isSaddlePoint (row, col) = cond1 && cond2 ","num_views":0,"num_stars":3,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"pthariensflame"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/pthariensflame","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"bf9f16b250574a9984e0d0119a758f98","snippet":"module Matrix (saddlePoints) where import qualified Data.Array as A import Control.Monad (guard) saddlePoints :: (A.Ix t, Ord a) => A.Array (t, t) a -> [(t, t)] saddlePoints xss = do ((i, j), x) <- A.assocs xss guard $ x == minimum (row' j xss) guard $ x == maximum (col' i xss) ","num_views":0,"num_stars":1,"num_comments":3,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"pismute"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/pismute","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"51ee0fcbc6fa4435908c456e20ca335b","snippet":"module Matrix where import Data.Array saddlePoints :: Array (Int,Int) Int -> [(Int,Int)] saddlePoints a = filter (check a) (indices a) check :: Array (Int,Int) Int -> (Int,Int) -> Bool check a i = f (<=) fst && f (>=) snd where ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Abbath"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/Abbath","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"1468f54ee2fb4903b8fbbe08b00b8e25","snippet":"module Matrix (saddlePoints) where import Data.Array (Array, bounds, indices, (!)) import qualified Data.Array as A saddlePoints matrix = filter (isSaddlePoint matrix) (indices matrix) isSaddlePoint matrix c@(x,y) = matrix ! c == maxElemInSameRow && matrix ! c == minElemInSameColumn where ((sx,sy),(ex,ey)) = bounds matrix ","num_views":0,"num_stars":2,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Arxyi"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/Arxyi","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"a46e06e0a250450aacf18bb6aadc5906","snippet":"module Matrix (saddlePoints) where import Data.Array (Array, bounds, (!)) import Data.Ix (range) saddlePoints :: Array (Int, Int) Int -> [(Int, Int)] saddlePoints matrix = [(a, b) | a <- range(x0, x1), b <- range(y0, y1), (saddle a b)] where ((x0,y0), (x1, y1)) = bounds matrix saddle x y = all (\(a, b) -> (matrix!(a, b) <= matrix!(x, y))) [(x, y') | y' <- range(y0, y1), y' /= y] && all (\(a, b) -> (matrix!(a, b) >= matrix!(x, y))) [(x', y) | x' <- range(x0, x1), x' /= x]","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"kamelzcs"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/kamelzcs","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"2de3f49881e14b53b9bdbb5ae5253639","snippet":"module Matrix (saddlePoints) where import Data.Array (Array, (!), assocs, bounds) saddlePoints :: Array (Int, Int) Int -> [(Int,Int)] saddlePoints matrix = [ (i, j) | ((i, j), n) <- assocs matrix , n >= maximum (row i) , n <= minimum (col j) ] where row i = [ matrix ! (i, j) | j <- [jMin..jMax] ] ","num_views":0,"num_stars":3,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"rbasso"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/rbasso","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"7c04377ba08d48f98791c737122bd5ba","snippet":"module Matrix (saddlePoints) where import Data.Array (Array, (!), bounds, indices) saddlePoints :: (Num a, Ord a) => Array (Int, Int) a -> [(Int,Int)] saddlePoints matrix = filter (isSaddle matrix) (indices matrix) isSaddle :: (Num a, Ord a) => Array (Int, Int) a -> (Int,Int) -> Bool isSaddle matrix (row, col) = x == maximum xrow && x == minimum xcol where ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"ed359"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/ed359","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"8e2820c597a247b8b5dbb04e0cb9d07b","snippet":"module Matrix (saddlePoints) where import Data.Array (Array, (!), bounds) saddlePoints :: (Ord e) => Array (Int, Int) e -> [(Int, Int)] saddlePoints matrix = [ (r, c) | r <- [rf..rt], c <- [cf..ct] , matrix ! (r, c) == maximum [matrix ! (r, c') | c' <- [cf..ct]] , matrix ! (r, c) == minimum [matrix ! (r', c) | r' <- [rf..rt]] ] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"lvs7k"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/lvs7k","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"44f824afdc8b411c8c514d26db72efba","snippet":"module Matrix (saddlePoints) where import Data.Array import Control.Monad (ap) saddlePoints mat = [(fst x, fst y) | x <- ap zip (map mxrow) [lr..hr], y <- ap zip (map mncol) [lc..hc], snd x == snd y] where ((lr, lc), (hr, hc)) = bounds mat ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"NoLongerBreathedIn"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/NoLongerBreathedIn","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"cca3436c346a46d2bf0d46ad8b72cc4c","snippet":"{-# LANGUAGE TupleSections #-} module Matrix ( saddlePoints ) where import Data.Array import Data.List (foldl', intersect, sort) type Cell a = (Point, a) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":30,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-08-13T21:45:53.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"tlarrieu"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/tlarrieu","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"4e761361d75d4d3197222e2c1ae23be6","snippet":"module Matrix (saddlePoints) where import Data.Array row :: Ord e => Ix i => Ix j => Array (i, j) e -> (i, j) -> [e] row matrix a = [y | (b, y) <- (assocs matrix), fst a == fst b] col :: Ord e => Ix i => Ix j => Array (i, j) e -> (i, j) -> [e] col matrix a = [y | (b, y) <- (assocs matrix), snd a == snd b] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-12-14T11:11:53.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"christianitie"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/christianitie","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"285906a06f954214ae76a9de17dc1b07","snippet":"module Matrix ( saddlePoints ) where import Data.Array getRow, getCol :: (Ix i) => i -> Array (i, i) e -> [e] getRow n = map snd . filter (\((i, _), _) -> i == n) . assocs getCol n = map snd . filter (\((_, i), _) -> i == n) . assocs ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-11-28T01:13:22.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"ptrfrncsmrph"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/ptrfrncsmrph","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"dbb730d8bc7647a994694359291de7f2","snippet":"module Matrix (saddlePoints) where import Data.Array (Array, range, elems, bounds) isSaddlePoint :: [((Int, Int), Int)] -> ((Int, Int), Int) -> Bool isSaddlePoint indicesWithValues ((x, y), v) = let sameCols = fmap snd (filter (\((x2,_), _) -> x2 == x) indicesWithValues) sameRows = fmap snd (filter (\((_,y2), _) -> y2 == y) indicesWithValues) in (maximum sameCols == v) && (minimum sameRows == v) saddlePoints :: Array (Int, Int) Int -> [(Int, Int)] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-11-27T13:17:54.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"misja111"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/misja111","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"e725c17b615241b5bcab7eee41d645d3","snippet":"module Matrix ( saddlePoints ) where import Data.Array -- saddlePoints :: Array i e -> [i] saddlePoints :: (Ord e) => Array (Int, Int) e -> [(Int, Int)] saddlePoints matrix = let ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-10-14T19:47:36.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"edejong"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/edejong","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"dd24771bc3164a4d8b69e0252038ea04","snippet":"module Matrix (saddlePoints) where import Data.Array (Array, bounds, (!)) saddlePoints :: Array (Int, Int) Int -> [(Int, Int)] saddlePoints matrix = [ (x,y) | x <- [zeroX..width] , y <- [zeroY..height] , matrix ! (x,y) == maxRow x , matrix ! (x,y) == minCols y ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-20T19:36:46.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"andynovo"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/andynovo","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"7dee9272f38d434eaf4c5708c6902edb","snippet":"module Matrix (saddlePoints) where import Data.Array type IntPair = (Int,Int) saddlePoints :: Ord e => Array IntPair e -> [IntPair] saddlePoints matrix = filter f points where points = indices matrix ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-12-29T22:14:47.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"leaf2fire"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/leaf2fire","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"342b3f08e34546549edc5b942de5e8db","snippet":"module Matrix (saddlePoints) where import Data.Array (Array, assocs, bounds, listArray, (!)) import Data.List (groupBy, sortOn) import Control.Arrow ((***), (&&&)) saddlePoints :: Ord e => Array (Int, Int) e -> [(Int, Int)] saddlePoints matrix = map fst . filter isSaddle $ assocs matrix where (start, end) = bounds matrix ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-01-14T05:44:26.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"guygastineau"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/guygastineau","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"dea6a8d809274c4e87f4d6011618af7f","snippet":"module Matrix ( saddlePoints, ) where import Data.Array (Array, Ix) import qualified Data.Array as A saddlePoints :: (Enum i, Ix i, Ord e) => Array (i, i) e -> [(i, i)] saddlePoints matrix = map fst . filter isSaddlePoint . A.assocs $ matrix ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-11-11T19:54:18.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"SiriusStarr"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/SiriusStarr","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"780687909bbf4499a2ceaf8a6f0a07eb","snippet":"module Matrix ( saddlePoints ) where import Data.Array type MatIx = (Int, Int) saddlePoints :: (Ord e, Show e) => Array MatIx e -> [MatIx] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-01-14T05:18:15.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"ddowl"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/ddowl","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"a0f686c751b64f04823e8bf495df35ff","snippet":"module Matrix (saddlePoints) where import Data.Array (Array, assocs) import Data.Ix (Ix) saddlePoints :: (Ix a, Ord e) => Array (a, a) e -> [(a, a)] saddlePoints matrix = [ i | (i, e) <- assocs matrix , e == (maximum . dimension fst i) matrix , e == (minimum . dimension snd i) matrix ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-02-22T15:21:25.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"lidin"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/lidin","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}},{"uuid":"99325c6cc9b14142b7891bd36b9556d2","snippet":"module Matrix (saddlePoints) where import Data.Array (Array, indices, (!)) type Coord = (Int, Int) type Matrix = Array (Int, Int) Int isMinInColumn :: Matrix -> Coord -> Bool isMinInColumn matrix coord = all ( (>=) ( matrix ! coord ) ) $ map ( (!) matrix ) $ columnCoords where columnCoords = filter (\(x, _) -> x == x0) $ indices matrix ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-07-03T10:22:19.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Prosperoh"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/solutions/Prosperoh","private_iterations_url":"https://exercism.org/bn/tracks/haskell/exercises/saddle-points/iterations"}}],"meta":{"current_page":1,"total_count":294,"total_pages":13,"unscoped_total":294}}}}}

ভাষার ট্র্যাক

Jiki-এর সাথে কোড শেখা

আপনার যাত্রা

আপনার পছন্দের তালিকানতুন

Exercism-এর সুবিধা

কমিউনিটি ভিডিও

সংক্ষিপ্ত পরিচিতি সিরিজ

সাক্ষাৎকার ও গল্প

Discord

ফোরাম

শুরু করা

মেন্টরিং

ডকুমেন্টেশন

কনট্রিবিউটর

অনুবাদকনতুন

ডোনেট করুন

Exercism সম্পর্কে

আমাদের প্রভাব

GitHub সিঙ্কারনতুন

ইনসাইডার্স