{"request":{"endpoint":"https://exercism.org/api/v2/tracks/lean/exercises/isogram/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"fc351a82864e4eafb83e8b4750004911","snippet":"namespace Isogram def isIsogram (phrase : String) : Bool := let ⟨ok, _⟩ := phrase.foldl (λ ⟨ok, seen⟩ char => if char.isAlpha then let idx := char.toUpper.toNat - 'A'.toNat ⟨ok && (seen &&& (1 <<< idx) == 0), seen ||| (1 <<< idx)⟩ else ⟨ok, seen⟩ ) (true, 0) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-01-25T19:41:02.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"oxe-b"},"exercise":{"title":"आइसोग्राम","icon_url":"https://assets.exercism.org/exercises/isogram.svg"},"track":{"title":"Lean","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/solutions/oxe-b","private_iterations_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/iterations"}},{"uuid":"fe451b004af245b796c4c2e33a3a1bee","snippet":"def isIsogram (phrase : String) : Bool := loop {} (normalize phrase) where normalize (s : String) : List Char := s.toLower.toList.filter Char.isAlpha loop (seen : Std.HashSet Char) : List Char → Bool | [] => true | c :: cs => if seen.contains c then false ","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-05-01T01:40:10.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"jinwoo"},"exercise":{"title":"आइसोग्राम","icon_url":"https://assets.exercism.org/exercises/isogram.svg"},"track":{"title":"Lean","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/solutions/jinwoo","private_iterations_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/iterations"}},{"uuid":"a23767449dae4a4db312ae27db84deff","snippet":"@[inline] private def tryAddLetter (mask : Nat) (c : Char) : Option Nat := if !c.isAlpha then some mask else let lc := c.toLower let i := (lc.val - 'a'.val).toNat let bit := 1 <<< i if mask &&& bit != 0 then none else some (mask ||| bit) @[inline] private def step (acc : Option Nat) (c : Char) : Option Nat := ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":18,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-05-17T17:03:31.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"david82"},"exercise":{"title":"आइसोग्राम","icon_url":"https://assets.exercism.org/exercises/isogram.svg"},"track":{"title":"Lean","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/solutions/david82","private_iterations_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/iterations"}},{"uuid":"2fb4a23ddff94a3197cff234d8621f0d","snippet":"def isIsogram (s : String) : Bool := let rec loop (cs : List Char) (seen : List Char) : Bool := match cs with | [] => true | c :: rest => if c == ' ' || c == '-' then loop rest seen else let lc := c.toLower if seen.contains lc then ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-04-10T16:18:30.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"SillyLily1313"},"exercise":{"title":"आइसोग्राम","icon_url":"https://assets.exercism.org/exercises/isogram.svg"},"track":{"title":"Lean","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/solutions/SillyLily1313","private_iterations_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/iterations"}},{"uuid":"94daa273f8dc455bba0f3b0de40dca56","snippet":"def isIsogram (phrase : String) : Bool := let letters := phrase.toList.filter Char.isAlpha |>.map Char.toUpper (Std.HashSet.ofList letters).size == letters.length ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":6,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-13T20:52:54.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"goiabae"},"exercise":{"title":"आइसोग्राम","icon_url":"https://assets.exercism.org/exercises/isogram.svg"},"track":{"title":"Lean","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/solutions/goiabae","private_iterations_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/iterations"}},{"uuid":"839df8f60e8c42e0bf684cf99a1c70fc","snippet":"def isIsogram (phrase : String) : Bool := let chars := phrase.toList |> List.filter (fun c ↦ c.isAlpha) |> List.map (fun c ↦ c.toLower) |> List.mergeSort (List.splitBy (fun a b ↦ a == b) chars).length == chars.length ","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":"passed","published_at":"2026-08-23T13:22:40.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"ramhuw"},"exercise":{"title":"आइसोग्राम","icon_url":"https://assets.exercism.org/exercises/isogram.svg"},"track":{"title":"Lean","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/solutions/ramhuw","private_iterations_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/iterations"}},{"uuid":"4ed1fb2ceaff430e843c6e4838653e97","snippet":"def isIsogram (phrase : String) : Bool := Id.run do let mut seen := [] for c in phrase.toLower.toList.filter (· ∉ [' ', '-']) do if c ∈ seen then return false else seen := c :: seen return true ","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":"2026-04-04T15:14:08.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"takah29"},"exercise":{"title":"आइसोग्राम","icon_url":"https://assets.exercism.org/exercises/isogram.svg"},"track":{"title":"Lean","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/solutions/takah29","private_iterations_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/iterations"}},{"uuid":"d958ad8011ba437688ae08a53e920f8b","snippet":"namespace Isogram def popCount (acc : Nat) (number : Nat) : Nat := if number > 0 then popCount (acc + (number &&& 1)) (number >>> 1) else acc def letterSet (letters : List Char) : Nat := List.foldl (fun (seen : Nat) (c : Char) => seen ||| (1 <<< (c.val.toNat - 97))) 0 letters def isIsogram (phrase : String) : Bool := ","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":"2026-01-22T01:48:56.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"keiraville"},"exercise":{"title":"आइसोग्राम","icon_url":"https://assets.exercism.org/exercises/isogram.svg"},"track":{"title":"Lean","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/solutions/keiraville","private_iterations_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/iterations"}},{"uuid":"3f6fe6ce414f47408e43a4d3cb701a3d","snippet":"def isIsogram (phrase : String) : Bool := phrase.map Char.toLower |>.toList.filter Char.isAlpha |>.Nodup","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":2,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-05-11T06:25:38.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Aeracius"},"exercise":{"title":"आइसोग्राम","icon_url":"https://assets.exercism.org/exercises/isogram.svg"},"track":{"title":"Lean","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/solutions/Aeracius","private_iterations_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/iterations"}},{"uuid":"958f2867107d4da399d5c09d190de670","snippet":"def countChars (s : String) : HashMap Char Nat := s.toList.foldl (fun m c => if (¬ (c.isWhitespace || c == '-')) then m.insert c.toLower (m.getD c.toLower 0 + 1) else m) {} def isIsogram (phrase : String) : Bool := let map := countChars phrase map.values.all (. == 1) ","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":"2026-08-20T04:50:04.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"sgomber"},"exercise":{"title":"आइसोग्राम","icon_url":"https://assets.exercism.org/exercises/isogram.svg"},"track":{"title":"Lean","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/solutions/sgomber","private_iterations_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/iterations"}},{"uuid":"3ff8e54a47ef4b7cb6df4da7e5bff7f7","snippet":"def isIsogram (phrase : String) : Bool := let initial : Option (HashSet Char) := some (Std.HashSet.emptyWithCapacity) phrase.toLower.chars.fold (λ acc c => acc.bind (λ map => if c.isAlpha then if map.contains c then none else some (map.insert c) else some map ) ","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-06-01T09:55:32.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"grixb"},"exercise":{"title":"आइसोग्राम","icon_url":"https://assets.exercism.org/exercises/isogram.svg"},"track":{"title":"Lean","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/solutions/grixb","private_iterations_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/iterations"}},{"uuid":"a78bdeda6de14a70ad960b1d0ec5f8ed","snippet":"def isIsogram (phrase : String) : Bool := Id.run do let mut hm: Std.HashSet Char := ∅ for c in phrase.chars.filter (·.isAlpha) |>.map (.toLower) do if hm.contains c then return false hm := hm.insert c true ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":9,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-05-04T12:44:04.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"setsunica"},"exercise":{"title":"आइसोग्राम","icon_url":"https://assets.exercism.org/exercises/isogram.svg"},"track":{"title":"Lean","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/solutions/setsunica","private_iterations_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/iterations"}},{"uuid":"31cd50ce99e14a978865b920dd82b360","snippet":"def normalize (s : String) : String := s |>.toLower |>.toList |>.filter Char.isAlpha |> .ofList def normalize' (s : String) := s |>.toLower ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":23,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-04-17T17:50:34.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"99-over-70"},"exercise":{"title":"आइसोग्राम","icon_url":"https://assets.exercism.org/exercises/isogram.svg"},"track":{"title":"Lean","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/solutions/99-over-70","private_iterations_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/iterations"}},{"uuid":"220219fe65a942f2a93f05cc33b3621d","snippet":"def isIsogram (phrase : String) : Bool := Id.run do let az := 'z'.toNat - 'a'.toNat + 1 let mut seen : Array Bool := Array.replicate az false for b in phrase.byteIterator.map UInt8.toAsciiLower do let idx := (b - 'a'.toUInt8).toNat if h : idx < seen.size then do if seen[idx]'h then return false else seen := seen.set idx true return true ","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-08-24T10:35:10.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"EarlGray"},"exercise":{"title":"आइसोग्राम","icon_url":"https://assets.exercism.org/exercises/isogram.svg"},"track":{"title":"Lean","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/solutions/EarlGray","private_iterations_url":"https://exercism.org/hi/tracks/lean/exercises/isogram/iterations"}}],"meta":{"current_page":1,"total_count":14,"total_pages":1,"unscoped_total":14}}}}}

भाषा ट्रैक

Jiki के साथ कोड करना सीखिए

आपकी यात्रा

आपके पसंदीदानया

Exercism के खास फायदे

कम्युनिटी वीडियो

संक्षिप्त परिचय शृंखला

इंटरव्यू और कहानियाँ

Discord

फोरम

शुरुआत करें

मेंटर बनें

डॉक्स

योगदानकर्ता

अनुवादकनया

दान करें

Exercism के बारे में

हमारा प्रभाव

GitHub सिंकरनया

इनसाइडर्स