{"id":34354,"date":"2023-03-04T18:15:10","date_gmt":"2023-03-04T12:45:10","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/"},"modified":"2023-03-04T18:15:10","modified_gmt":"2023-03-04T12:45:10","slug":"solved-print-non-repeating-combinations-closed","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/","title":{"rendered":"[Solved] Print non repeating combinations [closed]"},"content":{"rendered":"<p> [ad_1]<br \/>\n<\/p>\n<div id=\"answer-30193618\" class=\"answer js-answer accepted-answer js-accepted-answer\" data-answerid=\"30193618\" data-parentid=\"30193272\" data-score=\"0\" data-position-on-page=\"1\" data-highest-scored=\"1\" data-question-has-accepted-highest-score=\"1\" itemprop=\"acceptedAnswer\" itemscope itemtype=\"https:\/\/schema.org\/Answer\">\n<div class=\"post-layout\">\n<div class=\"votecell post-layout--left\"><\/div>\n<div class=\"answercell post-layout--right\">\n<div class=\"s-prose js-post-body\" itemprop=\"text\">\n<p>Interesting task. Try following code:<\/p>\n<pre><code>List&lt;string&gt; list = Enumerable.Range(1, 6).Select(e =&gt; ((char)('A' + e - 1)).ToString()).ToList();\nList&lt;string&gt; temp = new List&lt;string&gt;();\n\nint count = list.Count;\nint total = 1 &lt;&lt; list.Count;\nfor (int i = 0; i &lt; total; i++)\n{\n    int k = i;\n    temp.Clear();\n    for (int j = 0; j &lt; count; j++)\n    {\n        if ((k &amp; 1) == 1)\n        {\n            temp.Add(list[j]);\n        }\n        k &gt;&gt;= 1;\n    }\n    Console.WriteLine(string.Join(\" + \", temp.ToArray()));\n}\n<\/code><\/pre>\n<p>Output:<\/p>\n<pre><code>A\nB\nA + B\nC\nA + C\nB + C\nA + B + C\nD\nA + D\nB + D\nA + B + D\nC + D\nA + C + D\nB + C + D\nA + B + C + D\nE\nA + E\nB + E\nA + B + E\nC + E\nA + C + E\nB + C + E\nA + B + C + E\nD + E\nA + D + E\nB + D + E\nA + B + D + E\nC + D + E\nA + C + D + E\nB + C + D + E\nA + B + C + D + E\nF\nA + F\nB + F\nA + B + F\nC + F\nA + C + F\nB + C + F\nA + B + C + F\nD + F\nA + D + F\nB + D + F\nA + B + D + F\nC + D + F\nA + C + D + F\nB + C + D + F\nA + B + C + D + F\nE + F\nA + E + F\nB + E + F\nA + B + E + F\nC + E + F\nA + C + E + F\nB + C + E + F\nA + B + C + E + F\nD + E + F\nA + D + E + F\nB + D + E + F\nA + B + D + E + F\nC + D + E + F\nA + C + D + E + F\nB + C + D + E + F\nA + B + C + D + E + F\n<\/code><\/pre>\n<\/p><\/div>\n<div class=\"mt24\"><\/div>\n<\/div>\n<p>            <span class=\"d-none\" itemprop=\"commentCount\"><\/span> <\/p><\/div>\n<\/div>\n<p>[ad_2]<\/p>\n<p>solved Print non repeating combinations [closed] <\/p>\n","protected":false},"excerpt":{"rendered":"<p>[ad_1] Interesting task. Try following code: List&lt;string&gt; list = Enumerable.Range(1, 6).Select(e =&gt; ((char)(&#8216;A&#8217; + e &#8211; 1)).ToString()).ToList(); List&lt;string&gt; temp = new List&lt;string&gt;(); int count = list.Count; int total = 1 &lt;&lt; list.Count; for (int i = 0; i &lt; total; i++) { int k = i; temp.Clear(); for (int j = 0; j &lt; count; &#8230; <a title=\"[Solved] Print non repeating combinations [closed]\" class=\"read-more\" href=\"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/\" aria-label=\"More on [Solved] Print non repeating combinations [closed]\">Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[320],"tags":[324,578],"class_list":["post-34354","post","type-post","status-publish","format-standard","hentry","category-solved","tag-c","tag-linq"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.5 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>[Solved] Print non repeating combinations [closed] - JassWeb<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] Print non repeating combinations [closed] - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] Interesting task. Try following code: List&lt;string&gt; list = Enumerable.Range(1, 6).Select(e =&gt; ((char)(&#039;A&#039; + e - 1)).ToString()).ToList(); List&lt;string&gt; temp = new List&lt;string&gt;(); int count = list.Count; int total = 1 &lt;&lt; list.Count; for (int i = 0; i &lt; total; i++) { int k = i; temp.Clear(); for (int j = 0; j &lt; count; ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2023-03-04T12:45:10+00:00\" \/>\n<meta name=\"author\" content=\"Kirat\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Kirat\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] Print non repeating combinations [closed]\",\"datePublished\":\"2023-03-04T12:45:10+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/\"},\"wordCount\":20,\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"keywords\":[\"c++\",\"linq\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/\",\"url\":\"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/\",\"name\":\"[Solved] Print non repeating combinations [closed] - JassWeb\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#website\"},\"datePublished\":\"2023-03-04T12:45:10+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/jassweb.com\/solved\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] Print non repeating combinations [closed]\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/jassweb.com\/solved\/#website\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"name\":\"JassWeb\",\"description\":\"Build High-quality Websites\",\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/jassweb.com\/solved\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\",\"name\":\"Jass Web\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"contentUrl\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"width\":693,\"height\":132,\"caption\":\"Jass Web\"},\"image\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\",\"name\":\"Kirat\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775193939\",\"contentUrl\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775193939\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\/\/jassweb.com\"],\"url\":\"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] Print non repeating combinations [closed] - JassWeb","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] Print non repeating combinations [closed] - JassWeb","og_description":"[ad_1] Interesting task. Try following code: List&lt;string&gt; list = Enumerable.Range(1, 6).Select(e =&gt; ((char)('A' + e - 1)).ToString()).ToList(); List&lt;string&gt; temp = new List&lt;string&gt;(); int count = list.Count; int total = 1 &lt;&lt; list.Count; for (int i = 0; i &lt; total; i++) { int k = i; temp.Clear(); for (int j = 0; j &lt; count; ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/","og_site_name":"JassWeb","article_published_time":"2023-03-04T12:45:10+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] Print non repeating combinations [closed]","datePublished":"2023-03-04T12:45:10+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/"},"wordCount":20,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["c++","linq"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/","url":"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/","name":"[Solved] Print non repeating combinations [closed] - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2023-03-04T12:45:10+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-print-non-repeating-combinations-closed\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] Print non repeating combinations [closed]"}]},{"@type":"WebSite","@id":"https:\/\/jassweb.com\/solved\/#website","url":"https:\/\/jassweb.com\/solved\/","name":"JassWeb","description":"Build High-quality Websites","publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jassweb.com\/solved\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/jassweb.com\/solved\/#organization","name":"Jass Web","url":"https:\/\/jassweb.com\/solved\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/","url":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","contentUrl":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","width":693,"height":132,"caption":"Jass Web"},"image":{"@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31","name":"Kirat","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/","url":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775193939","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775193939","caption":"Kirat"},"sameAs":["http:\/\/jassweb.com"],"url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/"}]}},"_links":{"self":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/34354","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/comments?post=34354"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/34354\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=34354"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=34354"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=34354"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}