{"id":27598,"date":"2022-12-25T09:15:36","date_gmt":"2022-12-25T03:45:36","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/"},"modified":"2022-12-25T09:15:36","modified_gmt":"2022-12-25T03:45:36","slug":"solved-efficient-way-to-specific-combinations-from-string-closed","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/","title":{"rendered":"[Solved] Efficient Way to specific combinations from string [closed]"},"content":{"rendered":"

[ad_1]
\n<\/p>\n

\n
\n
<\/div>\n
\n
\n

First thing you need to explode the string by _<\/code><\/p>\n

$str=\"one_two_three_four_five_six\";\n$array = explode('_', $str);\n<\/code><\/pre>\n
Add an empty array to store result there<\/p>\n
$result = [];\n<\/code><\/pre>\n
Define a recursive function<\/strong> that takes an array, implode array values, remove last element and recall the same array until<\/strong> length is 0<\/p>\n
function visitArray($array, &$result) {\n    if(count($array) == 0) \/\/Check if length is 0 (Stop executing)\n        return;\n    $result[] = implode('_', $array); \/\/Implode array values\n    return visitArray(array_slice($array, 0, count($array) -  1), $result); \/\/Remove last element and call again the same function\n}\n<\/code><\/pre>\n
So if you pass [1, 2, 3]<\/code> to visitArray<\/strong> you will have
\n1_2_3<\/code>, 1_2<\/code>, 1<\/code> in the result array.<\/p>\n
Now you need a secondary function to call visitArray<\/code> with a new position, <\/p>\n
That means, if we have this array [1, 2, 3]<\/code><\/p>\n
we need to call visitArray<\/strong> [1,2,3]<\/code>, [2,3]<\/code>, [3]<\/code><\/p>\n
So we define a function with simple for loop to iterate around array values, and each time we call visitArray()<\/strong> and we ignore the called once by using array_slice with position<\/code> variable. <\/p>\n
function callVisit($array, &$result, $position = 0) {\n    for($i = 0; $i < count($array); $i++)\n        visitArray(array_slice($array, $position++, count($array) - 1), $result);\n}\n<\/code><\/pre>\n
Update:<\/strong>
\nIf you need to remove the position param you could replace the forloop with list as below:<\/p>\n
function callVisit($array, &$result) {\n    while (list(,$v) = each($array)) \n    { \n        visitArray($array, $result);\n        array_shift($array); \/\/Remove first element\n    } \n}\n<\/code><\/pre>\n
So you need to call callVisit() by passing two params, the array, result array (where result should be stored)<\/p>\n
callVisit($array, $result);\n<\/code><\/pre>\n
Full code:<\/strong> <\/p>\n
<?php\n\n$str=\"one_two_three_four_five_six\";\n\n$array = explode('_', $str);\n\n$result = [];\n\n\nfunction callVisit($array, &$result, $position = 0) {\n    for($i = 0; $i < count($array); $i++) \n        visitArray(array_slice($array, $position++, count($array) - 1), $result);\n}\n\nfunction visitArray($array, &$result) {\n    if(count($array) == 0)\n        return;\n    $result[] = implode('_', $array);\n    return visitArray(array_slice($array, 0, count($array) -  1), $result);\n}\n\n\ncallVisit($array, $result);\n\necho \"<pre>\", json_encode($result, JSON_PRETTY_PRINT), \"<\/pre>\";\n<\/code><\/pre>\n<\/p><\/div>\n
<\/div>\n<\/div>\n
            5<\/span> <\/p><\/div>\n<\/div>\n
[ad_2]<\/p>\n
solved Efficient Way to specific combinations from string [closed] <\/p>\n","protected":false},"excerpt":{"rendered":"
[ad_1] First thing you need to explode the string by _ $str=”one_two_three_four_five_six”; $array = explode(‘_’, $str); Add an empty array to store result there $result = []; Define a recursive function that takes an array, implode array values, remove last element and recall the same array until length is 0 function visitArray($array, &$result) { if(count($array) … 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":[1263,339],"class_list":["post-27598","post","type-post","status-publish","format-standard","hentry","category-solved","tag-combinations","tag-php"],"yoast_head":"\n[Solved] Efficient Way to specific combinations from string [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-efficient-way-to-specific-combinations-from-string-closed\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] Efficient Way to specific combinations from string [closed] - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] First thing you need to explode the string by _ $str="one_two_three_four_five_six"; $array = explode('_', $str); Add an empty array to store result there $result = []; Define a recursive function that takes an array, implode array values, remove last element and recall the same array until length is 0 function visitArray($array, &$result) { if(count($array) ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2022-12-25T03:45:36+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=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] Efficient Way to specific combinations from string [closed]\",\"datePublished\":\"2022-12-25T03:45:36+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/\"},\"wordCount\":167,\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"keywords\":[\"combinations\",\"php\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/\",\"url\":\"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/\",\"name\":\"[Solved] Efficient Way to specific combinations from string [closed] - JassWeb\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#website\"},\"datePublished\":\"2022-12-25T03:45:36+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/jassweb.com\/solved\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] Efficient Way to specific combinations from string [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=1775798750\",\"contentUrl\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775798750\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\/\/jassweb.com\"],\"url\":\"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] Efficient Way to specific combinations from string [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-efficient-way-to-specific-combinations-from-string-closed\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] Efficient Way to specific combinations from string [closed] - JassWeb","og_description":"[ad_1] First thing you need to explode the string by _ $str=\"one_two_three_four_five_six\"; $array = explode('_', $str); Add an empty array to store result there $result = []; Define a recursive function that takes an array, implode array values, remove last element and recall the same array until length is 0 function visitArray($array, &$result) { if(count($array) ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/","og_site_name":"JassWeb","article_published_time":"2022-12-25T03:45:36+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] Efficient Way to specific combinations from string [closed]","datePublished":"2022-12-25T03:45:36+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/"},"wordCount":167,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["combinations","php"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/","url":"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/","name":"[Solved] Efficient Way to specific combinations from string [closed] - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2022-12-25T03:45:36+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-efficient-way-to-specific-combinations-from-string-closed\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] Efficient Way to specific combinations from string [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=1775798750","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775798750","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\/27598","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=27598"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/27598\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=27598"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=27598"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=27598"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}