{"request":{"endpoint":"https://exercism.org/api/v2/tracks/unison/exercises/sublist/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"b660e4daff0c4cb282c89397c122e2ae","snippet":"unique type sublist.SublistType = Equal | Sublist | Superlist | Unequal sublist.sublist : [a] -> [a] -> SublistType sublist.sublist lst1 lst2 = startsWith : [a] -> [a] -> Boolean startsWith = cases [], _ -> true _, [] -> false (ha +: ta), (hb +: tb) | ha === hb -> startsWith ta tb | otherwise -> false ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-05-15T14:44:49.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"dreig"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/dreig","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"9325286fc4f94f93a7f48692bfa7362f","snippet":"unique type sublist.SublistType = Equal | Sublist | Superlist | Unequal sublist.sublist : [a] -> [a] -> SublistType sublist.sublist listOne listTwo = l1 = List.count (_ -> true) listOne l2 = List.count (_ -> true) listTwo if l1 == l2 then if contains listOne listTwo then SublistType.Equal else SublistType.Unequal else if l1 < l2 then if contains listTwo listOne then SublistType.Sublist else SublistType.Unequal else ","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":"errored","published_at":"2022-09-25T07:55:23.000Z","is_out_of_date":true,"language":"haskell","author":{"handle":"motoyasu-yamada"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/motoyasu-yamada","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"a8a6dfb52dc9451daece36f1fcd3dc42","snippet":"unique type sublist.SublistType = Equal | Sublist | Superlist | Unequal sublist.sublist : [a] -> [a] -> SublistType sublist.sublist a b = let match (a, b) with (a, b) | a === b -> Equal | isInfixOf a b -> Sublist | isInfixOf b a -> Superlist | true -> Unequal","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":"errored","published_at":"2023-01-03T02:02:20.000Z","is_out_of_date":true,"language":"haskell","author":{"handle":"pragdave"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/pragdave","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"7ff326197c0c48b68abe6836687e9af6","snippet":"type sublist.SublistType = Equal | Sublist | Superlist | Unequal sublist.sublist.doc = sublist.sublist : [a] -> [a] -> SublistType sublist.sublist listOne listTwo = if listOne === listTwo then Equal else if isInfixOf listOne listTwo then Sublist else if isInfixOf listTwo listOne then Superlist else Unequal ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":12,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-12-02T05:01:26.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"setsunica"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/setsunica","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"612d17f78fde4d8da11d4c4e6409b3c5","snippet":"unique type sublist.SublistType = Equal | Sublist | Superlist | Unequal sublist.sublist : [a] -> [a] -> SublistType sublist.sublist listOne listTwo = len1 = List.size listOne len2 = List.size listTwo if len1 < len2 then if isSublist listOne listTwo then Sublist else ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-08-05T14:40:12.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"OldIronHorse"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/OldIronHorse","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"6dc70ad9fd254687a5d95857f4fc146e","snippet":"unique type sublist.SublistType = Equal | Sublist | Superlist | Unequal sublist.sublist : [a] -> [a] -> SublistType sublist.sublist listOne listTwo = sizeOrder = (toInt (size listTwo)) - (toInt (size listOne)) match sizeOrder with sizeOrder | sizeOrder === +0 && (isOneSubOfTwo listOne listTwo) -> Equal | sizeOrder > +0 && (isOneSubOfTwo listOne listTwo) -> Sublist | sizeOrder < +0 && (isOneSubOfTwo listTwo listOne) -> Superlist ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":32,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"errored","published_at":"2022-09-20T13:40:21.000Z","is_out_of_date":true,"language":"haskell","author":{"handle":"agentofuser"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/agentofuser","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"84296012f57d403bbdb9b364a03da86b","snippet":"unique type sublist.SublistType = Equal | Sublist | Superlist | Unequal sublist.sublist : [a] -> [a] -> SublistType sublist.sublist listOne listTwo = listOneSize = List.size listOne listTwoSize = List.size listTwo if (listOneSize == listTwoSize) && (listOne === listTwo) then Equal else if (listOneSize < listTwoSize) && (List.isInfixOf listOne listTwo) then Sublist else if (listOneSize > listTwoSize) && (List.isInfixOf listTwo listOne) then Superlist ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-03-31T09:00:02.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"RustedBones"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/RustedBones","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"3514e5c208b04e548f40f2c95cc6b74d","snippet":"unique type sublist.SublistType = Equal | Sublist | Superlist | Unequal sublist.sublist : [a] -> [a] -> SublistType sublist.sublist listOne listTwo = match (listOne, listTwo) with (a, b) | a === b -> Equal | isInfixOf a b -> Sublist | isInfixOf b a -> Superlist _ -> Unequal ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-05-03T18:54:57.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"0x28"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/0x28","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"e0e43763b6334df9a494cbea689ebc30","snippet":"sublist.sublist : [a] -> [a] -> SublistType sublist.sublist = cases x, y | (isInfixOf x y, isInfixOf y x ) === (true, true ) -> Equal | isInfixOf x y -> Sublist | isInfixOf y x -> Superlist | otherwise -> Unequal unique type sublist.SublistType = SublistType.Equal | Sublist | Superlist | Unequal","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-05-25T22:44:20.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"mss7082"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/mss7082","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"5607115e97954bac8bbc5cf282e8663f","snippet":"unique type sublist.SublistType = Equal | Sublist | Superlist | Unequal sublist.sublist : [a] -> [a] -> SublistType sublist.sublist = cases listOne, listTwo | size listOne == size listTwo -> if isSome (indexOfSublist listOne listTwo) then Equal else Unequal listOne, listTwo | size listOne < size listTwo -> if isSome (indexOfSublist listOne listTwo) then Sublist else Unequal ","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":"2026-01-16T18:33:54.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"psftw"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/psftw","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"8b65e904c0764470b06cf9aef9257a08","snippet":"unique type sublist.SublistType = Equal | Sublist | Superlist | Unequal sublist.takeAt: Nat -> [a] -> Nat -> [a] sublist.takeAt length list startIndex = take length <| drop startIndex list sublist.isSuperlist : [a] -> [a] -> Boolean sublist.isSuperlist listOne listTwo = indexes = List.range 0 (size listOne - (size listTwo) + 1) listTwoLength = size listTwo ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-07-20T06:24:13.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"david82"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/david82","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"039e364154dc4a0c8342b31f78838a74","snippet":"sublist.takeAt: Nat -> [a] -> Nat -> [a] sublist.takeAt num lst idx = take num <| drop idx lst sublist.isSuperlist : [a] -> [a] -> Boolean sublist.isSuperlist listOne listTwo = indexes = List.range 0 (size listOne - (size listTwo) + 1) listTwoLength = size listTwo checker = (===) listTwo << (takeAt listTwoLength listOne) List.any checker indexes ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-03-28T19:39:04.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"brodo"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/brodo","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"ab3adba1860c4890b1885fddcf5a4fdc","snippet":"unique type sublist.SublistType = Equal | Sublist | Superlist | Unequal contains : [a] -> [a] -> Boolean contains a b = match (List.size b) with 0 -> true _ -> slidingWindow (List.size b) a |> List.contains b sublist.sublist : [a] -> [a] -> SublistType sublist.sublist = cases ","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-18T06:48:58.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"rxt30-1255"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/rxt30-1255","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"a91a24d20349414e8d6209a714a54e05","snippet":"unique type sublist.SublistType = Equal | Sublist | Superlist | Unequal sublist.sublist : [a] -> [a] -> SublistType sublist.sublist = cases listOne, listTwo | listOne === listTwo -> Equal | isInfixOf listOne listTwo -> Sublist ","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":"errored","published_at":"2023-04-19T11:05:26.000Z","is_out_of_date":true,"language":"haskell","author":{"handle":"gdbaldw"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/gdbaldw","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"d304b612163c4dbb8bbf1d608b7398dd","snippet":"unique type sublist.SublistType = Equal | Sublist | Superlist | Unequal sublist.sublist : [a] -> [a] -> SublistType sublist.sublist list1 list2 = find : [a] -> [a] -> Boolean find needle = cases [] -> needle === [] haystack@(_ +: haystack') -> on (<=) size needle haystack && ( ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":23,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-10-08T08:14:46.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"autf"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/autf","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"fcdca02a09244d718dd6d4643d15f6e7","snippet":"unique type sublist.SublistType = Equal | Sublist | Superlist | Unequal sublist.sublist lst1 lst2 = match (isInfixOf lst1 lst2, isInfixOf lst2 lst1) with (true, true) -> Equal (true, false) -> Sublist (false, true) -> Superlist _ -> Unequal","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":"2023-03-23T15:34:47.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"menketechnologies"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/menketechnologies","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"fd8233ca4c6844ee8ac5dfc9ea94d6f5","snippet":"unique type sublist.SublistType = Equal | Sublist | Superlist | Unequal sublist.sublist : [a] -> [a] -> SublistType sublist.sublist = cases l1, l2 | isEqual l1 l2 -> Equal l1, l2 | isSublist l1 l2 -> Sublist l1, l2 | isSublist l2 l1 -> Superlist _, _ -> Unequal sublist.isEqual : [a] -> [a] -> Boolean ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-05-31T08:11:11.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"marcobonifacio"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/marcobonifacio","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}},{"uuid":"0ae96a4025274c2cbddfc3dcce073568","snippet":"unique type sublist.SublistType = Equal | Sublist | Superlist | Unequal sublist.sublist : [a] -> [a] -> SublistType sublist.sublist xs ys = match (isInfixOf xs ys, isInfixOf ys xs) with (true, true) -> Equal (true, false) -> Sublist (false, true) -> Superlist _ -> Unequal ","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":"2023-01-16T10:18:14.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"NegiGreenWhite"},"exercise":{"title":"المصفوفة الفرعية","icon_url":"https://assets.exercism.org/exercises/sublist.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/solutions/NegiGreenWhite","private_iterations_url":"https://exercism.org/ar/tracks/unison/exercises/sublist/iterations"}}],"meta":{"current_page":1,"total_count":18,"total_pages":1,"unscoped_total":18}}}}}

مسارات اللغات

تعلّم البرمجة مع Jiki

رحلتك

مفضلاتكجديد

مزايا Exercism

فيديوهات المجتمع

سلسلة المقدمات الموجزة

مقابلات وقصص

Discord

المنتدى

البدء

الإرشاد

الوثائق

المساهمون

المترجمونجديد

تبرّع

عن Exercism

أثرنا

مزامن GitHubجديد

Insiders