{"request":{"endpoint":"https://exercism.org/api/v2/tracks/scala/exercises/saddle-points/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"7c29f5923cb2401abdfba109656eb948","snippet":"case class Matrix(matrix: List[List[Int]]) { def saddlePoints: Set[(Int, Int)] = { def isSaddle(row: Int, col: Int): Boolean = { matrix(row)(col) == matrix(row).max && matrix(row)(col) == matrix.map(_ (col)).min } if (matrix.forall(_.isEmpty)) Set() else { matrix.indices.flatMap(x => matrix.indices.collect { case y if isSaddle(x, y) => (x, y) }).toSet ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2021-08-10T14:26:38.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"RGlossop"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/RGlossop","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"c37dafcd28b641378c4c5af7caad572b","snippet":"case class Matrix(matrix: List[List[Int]]) { def saddlePoints: Set[(Int, Int)] = { if (matrix.head.isEmpty) Set.empty else { val rows = matrix.map(row => (row.toArray, row.max)).zipWithIndex val cols = matrix.transpose.map(col => (col.toArray, col.min)).zipWithIndex for { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-11-13T16:19:57.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"tombeck"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/tombeck","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"0e1da86a505545f7a64e9a5c59892c4c","snippet":"/** * * @author Cedric Zhuang * */ case class Matrix(values: List[List[Int]]) { lazy val columnMin: List[Int] = values.transpose.map(_.min) lazy val rowMax: List[Int] = ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"tests_failed","published_iteration_head_tests_status":"failed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"jealous"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/jealous","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"ef885e8f29c144ccb0d13a1ef7a29455","snippet":"case class Matrix(ls: List[List[Int]]) { def saddlePoints: Set[(Int,Int)] = { if (ls == List(Nil)) Set() else { val cols = ls.transpose.map(_.min) val rows = ls.map(_.max) for { (x,i) <- rows.zipWithIndex.toSet ","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":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"jaratma"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/jaratma","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"6e92af06f6cf452dabf2298cfbac7af7","snippet":"case class Matrix(rows: List[List[Int]]) { def saddlePoints: Set[(Int, Int)] = { for (row <- rows; idx <- row.indices; if row(idx) == row.max && row(idx) == rows.map(r => r(idx)).min) yield (rows.indexOf(row), idx) }.toSet } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":6,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2018-10-22T13:36:00.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"albadc"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/albadc","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"f81fb0d70aa74416abb7a0c6f743a969","snippet":"case class Matrix(rows: List[List[Int]]) { lazy val cols = rows.transpose def saddlePoints: Set[(Int, Int)] = (for (i <- rows.indices; j <- cols.indices if rows(i).max == cols(j).min) yield (i, j)).toSet }","num_views":0,"num_stars":4,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"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":"scala","author":{"handle":"szafirov"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/szafirov","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"2b5a32b895814bba83ec03afa7450e26","snippet":"class Matrix(val ints: List[List[Int]]) { def saddlePoints: Set[(Int, Int)] = { (for { i <- ints.indices j <- ints.head.indices if ints(i).forall(_ <= ints(i)(j)) && ints.map(_ (j)).forall(_ >= ints(i)(j)) } yield (i, j)).toSet } } ","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-07-13T10:01:29.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"jicahoo"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/jicahoo","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"fbc51bcb7e73442ca6b0a94113e76620","snippet":"case class Matrix(matrix: List[List[Int]]) { private def findGreatest(row: List[Int]) = row.max private def findLowest(column: List[Int]) = column.min private def column(idx: Int): List[Int] = { for { row <- matrix } yield row(idx) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-01-27T21:38:41.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"speedcom"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/speedcom","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"e5bba23fd7fd4ecbb936798a343264be","snippet":"case class Matrix(private val rows: List[List[Int]]) { def saddlePoints: Set[(Int, Int)] = { val cols = rows.transpose val points = for { row <- rows.indices col <- rows.head.indices value = rows(row)(col) if rows(row).max == value && cols(col).min == value } yield (row, col) points.toSet ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-10-07T14:08:43.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"oleg-zinovev"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/oleg-zinovev","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"f2d2377a38cf4ab5bfc1ff580fe59482","snippet":"case class Matrix(cells: List[List[Int]]) { def saddlePoints: Set[(Int, Int)] = { cells.zipWithIndex .flatMap({ case (row, rowIdx) => row.zipWithIndex.map({ case (_, colIdx) => isSaddlePoint(colIdx, rowIdx) match { case true => (rowIdx, colIdx) case false => null ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-04-16T18:20:22.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"cmarshall10450"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/cmarshall10450","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"d2da564f022b4d5ba0497f3982dccc40","snippet":"case class Matrix(matrix: List[List[Int]]) { def saddlePoints: Set[(Int, Int)] = { (for (row <- matrix; value <- row; index = row.indexOf(value) if row.max == matrix.map(_(index)).min) yield (matrix.indexOf(row), index)) .toSet } ","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":"failed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"steffenalbrecht"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/steffenalbrecht","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"fedf62ee503f4ab9a897f8e69b426ca3","snippet":"case class Matrix(rows: List[List[Int]]) { private val cols = rows.transpose def saddlePoints: Set[(Int, Int)] = (for { i <- cols.indices j <- rows.indices n = rows(i)(j) if n == rows(i).max && n == cols(j).min ","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":"failed","published_at":"2019-09-25T23:23:22.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"gstro"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/gstro","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"85d7ed3b7eb247d88be59ea9b6a5fa16","snippet":" case class Matrix(matrix:List[List[Int]]){ def saddlePoints:Set[(Int,Int)] ={ val rowMaximums = matrix.filter(_.nonEmpty).map(_.max).zipWithIndex val colMinimums = matrix.transpose.filter(_.nonEmpty).map(_.min).zipWithIndex (for{ row <- rowMaximums ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-12-10T13:57:18.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"nickandh"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/nickandh","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"012bd43528944ef187e624b9d17ac51e","snippet":"case class Matrix(list: List[List[Int]]) { val saddlePoints: Set[(Int, Int)] = (for { row <- list.indices col <- list.head.indices transposed = list.transpose if list(row).max == list(row)(col) && transposed(col).min == list(row)(col) } yield (row, col)).toSet } ","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":"2019-08-25T21:36:31.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"SergiiVlasiuk"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/SergiiVlasiuk","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"afa11814a9ef48e686e980a31b5311c3","snippet":"import scala.collection.mutable.ListBuffer // 10-11-19 case class Matrix(grid: List[List[Int]]) { type Points = (Int, Int) val saddlePoints: Set[Points] = usingFlatMap // usingFolding // usingForEach ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":46,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-10-14T15:39:18.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"Ric0chet"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/Ric0chet","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"30059f8c8b234d94b4265bc1624b839f","snippet":"case class Matrix(m: List[List[Int]]){ def col(i: Int):List[Int] = m.map( row => row(i)) def saddlePoints: Set[(Int, Int)] = (for( rowIndex <- m.indices; colIndex <- m(rowIndex).indices if (m(rowIndex)(colIndex) == col(colIndex).min && m(rowIndex)(colIndex) == m(rowIndex).max) ) yield (rowIndex, colIndex)).toSet }","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":"2020-07-03T15:57:59.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"R4ncid"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/R4ncid","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"ecb75f664e8e481e9d82b0a5c8e56aa0","snippet":"case class Matrix(m: List[List[Int]]) { def rowsToCols(m: List[List[Int]]): List[List[Int]] = (0 until m.size).map(x => (0 until m(x).size).map(y => m(y)(x)).toList).toList def findMaxIndex(l: List[Int]): List[Int] = l.zipWithIndex.groupBy(_._1).maxBy(_._1)._2.map(_._2).toList def findMinIndex(l: List[Int]): List[Int] = l.zipWithIndex.groupBy(_._1).minBy(_._1)._2.map(_._2).toList def flattenIndicies(x: (List[Int], Int)): List[(Int, Int)] = x._1.map(i => (i, x._2)) def matToIndex(m: List[List[Int]], f: (List[Int]) => List[Int]) = ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2021-06-14T02:05:40.000Z","is_out_of_date":true,"language":"scala","author":{"handle":"dvatterott"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/dvatterott","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"3784e13287c2427ebcf9e04348350a43","snippet":"case class Matrix(rows: Seq[Seq[Int]]) { case class MatrixValue(row: Int, col: Int, value: Int) val matrix: Seq[MatrixValue] = rows .zipWithIndex .flatMap { case (values, row) => values .zipWithIndex ","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":"2021-01-22T13:10:08.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"sanderploegsma"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/sanderploegsma","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"e2ab9134bb084c94a523efc47c1ece80","snippet":"case class Matrix(mat: List[List[Int]]) { def saddlePoints: Set[(Int, Int)] = { def checkColumn(value: Int, col: Int): Boolean = !(for (row <- mat) yield row(col)).exists(_ < value) def checkRow(value: Int, row: Int): Boolean = !mat(row).exists(_ > value) mat.map(_.zipWithIndex).zipWithIndex.flatMap { case (row, i) => row.filter { case (value, j) => ","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":"2020-08-02T11:55:39.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"arunkmv"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/arunkmv","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"ac82edcfb62e4deab32e6ac16f7cff4d","snippet":"case class Matrix(repr: List[List[Int]]) { def saddlePoints: Set[(Int, Int)] = if (repr.head.isEmpty) Set() else { val u = for { r <- repr } yield r.max val v = for { r <- repr.transpose ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-10-07T13:33:25.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"visar"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/visar","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"cb12e5c4fcae4f42b95cac24845af0b0","snippet":"case class Matrix(rows: List[List[Int]]) { val saddlePoints = Matrix.saddlePoints(rows) } object Matrix { def saddlePoints(rows: List[List[Int]]): Set[(Int, Int)] = { val rowMaximums = rows.flatMap(_.maxOption) val colMinimums = rows.transpose.flatMap(_.minOption) rowMaximums.zipWithIndex.flatMap({ case (max, i) => colMinimums.zipWithIndex.collect({ case (min, j) if min == max => (i, j) }) ","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":"2022-08-21T06:34:32.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"irisTa56"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/irisTa56","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"b052fc27edcb40a7a13f006694aa8717","snippet":"class Matrix(rows: List[List[Int]]) { val saddlePoints: Set[(Int, Int)] = findSaddlePoints() private def findSaddlePoints(): Set[(Int, Int)] = { val rowMaxs: List[(List[Int], Int)] = rows.map(r => { val max: Int = if (r.nonEmpty) r.max else 0 val maxIndices: List[Int] = r.zipWithIndex.filter(_._1 == max).map(_._2) maxIndices }).zipWithIndex ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":33,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-12-19T07:22:43.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"edDevEdu"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/edDevEdu","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"c4bf486d624e41c695d601db8746c191","snippet":"case class Matrix(data: List[List[Int]]) { def saddlePoints: Set[(Int, Int)] = if ( data.isEmpty || data.exists(_.isEmpty) ) Set.empty else { val rowMax = data.map(_.max) val colMin = data.head.indices.map(c => data.map(_(c)).min) for { r <- data.indices c <- data(r).indices ","num_views":0,"num_stars":0,"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":"2022-09-08T20:52:24.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"justinp"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/justinp","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}},{"uuid":"01a9d47eee8641319acb53d7d4a5a175","snippet":"class Matrix(val rows: List[List[Int]]): private lazy val cols = rows.transpose def saddlePoints: Set[(Int, Int)] = if rows.forall(_.isEmpty) then Set() else for { (a, i) <- rows.map(_.max).zipWithIndex.toSet (b, j) <- cols.map(_.min).zipWithIndex.toSet ","num_views":0,"num_stars":0,"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":"2025-01-09T09:18:52.000Z","is_out_of_date":false,"language":"scala","author":{"handle":"hubat"},"exercise":{"title":"স্যাডল পয়েন্ট","icon_url":"https://assets.exercism.org/exercises/saddle-points.svg"},"track":{"title":"Scala","icon_url":"https://assets.exercism.org/tracks/scala.svg","highlightjs_language":"scala"},"links":{"public_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/solutions/hubat","private_iterations_url":"https://exercism.org/bn/tracks/scala/exercises/saddle-points/iterations"}}],"meta":{"current_page":1,"total_count":86,"total_pages":4,"unscoped_total":86}}}}}

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

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

আপনার যাত্রা

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

Exercism-এর সুবিধা

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

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

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

Discord

ফোরাম

শুরু করা

মেন্টরিং

ডকুমেন্টেশন

কনট্রিবিউটর

অনুবাদকনতুন

ডোনেট করুন

Exercism সম্পর্কে

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

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

ইনসাইডার্স