{"request":{"endpoint":"https://exercism.org/api/v2/tracks/fsharp/exercises/killer-sudoku-helper/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"84e4196aabbd44f0b597367f9f77a7ed","snippet":"module KillerSudokuHelper module List = let rec combinations n l = match n, l with | 0, _ -> [ [] ] | _, [] -> [] | k, (x :: xs) -> List.map ((@) [ x ]) (combinations (k - 1) xs) @ combinations k xs ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-11-25T08:17:18.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"ErikSchierboom"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/ErikSchierboom","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"1cfe9a54173746dc898bd9d86c1d4473","snippet":"module KillerSudokuHelper let combinations (exclude : int list) targetSize targetSum = let allowedNum = [9..-1..1] |> List.except exclude let rec getOptions remaining accu sum len = seq { if len = targetSize then if sum = targetSum then yield! [accu] elif len < targetSize then ","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":"2025-02-23T15:05:21.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"dse"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/dse","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"d1c4cf1f4dff4e45b35202bfdac5b023","snippet":"module KillerSudokuHelper let rec generateCombinations (posibleNums: int list) size : (int list) seq = seq { match size with | 1 -> for n in posibleNums do yield [n] | _ -> for n in posibleNums do yield! (generateCombinations (posibleNums|> List.filter(fun nn -> n < nn)) (size - 1)) |> Seq.map(fun p -> n :: p) ","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":"2024-11-29T20:44:21.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"vkvkv"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/vkvkv","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"90caf33e766740fc88f5661ef7f43ec1","snippet":"module KillerSudokuHelper let combinations exclude size sum = let rec combine proposals digits = if proposals |> List.head |> List.length = size then proposals else let nextProposals = proposals |> List.collect (fun p -> ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-07T15:01:37.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"b47on"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/b47on","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"d28d98643f0a43cf81608f53a33e8f51","snippet":"module KillerSudokuHelper let combinations (exclude:int list) (size:int) (sum:int) = let rec loop (possibles:int array) (count:int) (chosen:int array) = if count = 0 then [| chosen |] else [| 0..(possibles.Length - count) |] |> Array.collect (fun index -> loop (Array.skip (index + 1) possibles) (count - 1) (Array.append chosen [| possibles[index] |])) loop ([|1..9|] |> Array.filter (fun p -> exclude |> List.contains p |> not)) size [||] |> Array.filter (fun chs -> Array.sum chs = sum) |> Array.map List.ofArray |> List.ofArray ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-06-24T01:30:13.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"shawn-martin"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/shawn-martin","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"4076681caa1e4f1580fe139c9ca4145d","snippet":"module KillerSudokuHelper let rec private picks sets nums = match nums with | [] -> sets | hd :: tl -> picks [ for set in sets do yield set yield set @ [ hd ] ] ","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":"2025-10-11T18:31:54.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"aage"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/aage","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"c98064ba1c7f4ed0912d678b017e858e","snippet":"module KillerSudokuHelper let combinations (exclude: int list) (size: int) (targetSum: int) : int list list = let availableDigits = [1 .. 9] |> List.filter (fun d -> not (List.contains d exclude)) let rec solve count remainingSum minDigit = if count = 0 then if remainingSum = 0 then [[]] else [] elif remainingSum < minDigit then [] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-07-23T13:45:34.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"david82"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/david82","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"d7c700ac3b6a4e0d96091e9e73662406","snippet":"module KillerSudokuHelper let combinations (exclude:int list) (size:int) (sum:int) = if exclude |> List.contains sum then [] else let rec comb acc start size sum = if size = 0 then if sum = 0 then [List.rev acc] else [] else ","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":"2026-09-01T03:51:36.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"licon4812"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/licon4812","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"62d754bab32141d8a309fdafd9dd5af6","snippet":"module KillerSudokuHelper let combinations exclude size sum = let rec combinationsHelper currentSum remainingSize acc current digits = match remainingSize, currentSum with | 0, 0 when List.length current = size -> [List.rev current] | 0, _ -> [] | _, _ when currentSum < 0 || List.isEmpty digits -> [] | _, _ -> digits ","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":"2024-11-24T17:04:27.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"ktunprasert"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/ktunprasert","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"f1db4f5f9aa6452d9778f25fa0a56010","snippet":"module KillerSudokuHelper let rec dfs exclude size sum start acc = if List.length acc = size then if sum = 0 then [List.rev acc] else [] else let range = [start..(min 9 sum)] List.filter (fun x -> not (List.contains x exclude)) range |> List.map (fun x -> dfs exclude size (sum - x) (x + 1) (x :: acc)) |> List.concat ","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-05-06T09:54:54.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"liuq901"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/liuq901","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"657a98154c374af9bac72e891127e7a7","snippet":"module KillerSudokuHelper let combinations exclude size sum = let rec generateCombinations size minDigit targetSum = if size = 0 then if targetSum = 0 then [[]] else [] elif targetSum <= 0 || minDigit > 9 then [] else [minDigit..9] ","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":"2025-05-17T18:53:59.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"VickMahase"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/VickMahase","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"ea55a4969ab44d4289e3da3e50bab5d4","snippet":"module KillerSudokuHelper let combinations (exclude: int list) (size: int) (sum: int) : int list list = let comboOf2 (tempExclude: int Set) (tempSum: int) = let extraSubtract = if tempSum % 2 = 0 then 1 else 0 let max = tempSum / 2 - extraSubtract seq { 1..max } |> Seq.map (fun n -> [ n; tempSum - n ]) |> Seq.toList ","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":"2024-10-24T04:43:59.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"SteleTrovilo"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/SteleTrovilo","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"6c9daa6e556f4165aa23ca638fa0f3d4","snippet":"module KillerSudokuHelper let combinations exclude size sum = let availableDigits = List.filter (fun x -> not(List.contains x exclude)) [1;2;3;4;5;6;7;8;9] let rec solveCPS remainingSize remainingSum availableDigits currentComb k = if remainingSize = 0 then if remainingSum = 0 then k [ List.rev currentComb ] else k [] elif remainingSum < 0 then k [] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-08-12T20:32:44.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"Alexnevsky"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/Alexnevsky","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"7516edebc2ac4c8d916f99c99188ddad","snippet":"module KillerSudokuHelper let rec combinations (exclude: int list) (size: int) (sum: int): int list list = let allNumbers = [1..9] |> List.filter (fun n -> not (List.contains n exclude)) match size with | 1 -> if List.contains sum allNumbers then [[sum]] else [] | _ -> allNumbers |> List.filter (fun n -> n <= sum) ","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":"2025-01-22T20:15:25.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"ADSouthern"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/ADSouthern","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"6980116593c3436ea3e6e5b0cf59c6e5","snippet":"module KillerSudokuHelper let rec listCombs list = match list with | [] -> [[]] | h :: t -> let includeH = listCombs t |> List.map (fun ls -> h :: ls) let excludeH = listCombs t includeH @ excludeH ","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":"2025-02-24T09:27:18.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"EspenBerget"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/EspenBerget","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"f73c3b1beebc4adb8e1e1bddd50818de","snippet":"module KillerSudokuHelper let combinations exclude size sum = let digits = [1..9] |> List.except exclude ([ [] ], [1..size]) ||> Seq.fold (fun combinations _ -> [ for combination in combinations do for digit in digits do if not (combination |> List.contains digit) then List.sort (digit :: combination) ","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":"2024-12-27T17:28:07.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"JDiLenarda"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/JDiLenarda","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"b6c8b734fcc842c8b97a2ac922a699d0","snippet":"module KillerSudokuHelper let combinations (exclude:int list) (size:int) (sum:int) : int list list = let validNumbers = [1..9] |> List.except exclude |> List.filter ((>=) sum) let rec combi (acc:int list list) (current:int list) (remaining:int list) (remainingSum:int) = match remaining with | [] -> if remainingSum = 0 && List.length current = size then current::acc else acc | x::xs -> let newAcc = combi acc current xs remainingSum if x <= remainingSum then ","num_views":0,"num_stars":0,"num_comments":1,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-03-02T15:36:26.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"sinuhe69"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/sinuhe69","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"ff8658ebed5f434297a255a4fe15bec2","snippet":"module KillerSudokuHelper let rec sums (exclude: int list) (size: int) (target: int) (start: int): int list list = if size = 0 then if target = 0 then [[]] else [] elif start > target then [] else let starts = [start..9] |> List.except exclude [ for pStart in starts do if pStart <= target then ","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":"2025-10-12T08:55:58.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"gogent01"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/gogent01","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}},{"uuid":"ec9bcac45a764a15b6fb2ffd91100505","snippet":"module KillerSudokuHelper let rec private allSortedCombs numbers size = if size = 1 then numbers |> List.map List.singleton else numbers |> List.collect (fun n -> allSortedCombs (numbers |> List.filter ((<) n)) (size - 1) |> List.map (fun c -> n :: c)) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-25T20:14:23.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"Teilzeitdenker"},"exercise":{"title":"Killer Sudoku হেল্পার","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/solutions/Teilzeitdenker","private_iterations_url":"https://exercism.org/bn/tracks/fsharp/exercises/killer-sudoku-helper/iterations"}}],"meta":{"current_page":1,"total_count":19,"total_pages":1,"unscoped_total":19}}}}}

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

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

আপনার যাত্রা

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

Exercism-এর সুবিধা

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

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

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

Discord

ফোরাম

শুরু করা

মেন্টরিং

ডকুমেন্টেশন

কনট্রিবিউটর

অনুবাদকনতুন

ডোনেট করুন

Exercism সম্পর্কে

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

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

ইনসাইডার্স