{"id":8244,"date":"2022-10-19T23:00:00","date_gmt":"2022-10-19T17:30:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=8244"},"modified":"2022-11-26T18:06:46","modified_gmt":"2022-11-26T12:36:46","slug":"two-strings-game-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/two-strings-game-hackerrank-solution\/","title":{"rendered":"Two Strings Game &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>Two Strings Game HackerRank Solution<\/strong>. This problem <strong>(Two Strings Game)<\/strong> is a part of <strong>HackerRank Problem Solving<\/strong> series.<\/p>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_65 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-662c740f43f14\" class=\"ez-toc-cssicon-toggle-label\"><label class=\"ez-toc-title\">Table of Contents<\/label>\n<span class=\"ez-toc-cssicon\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #0090ff;color:#0090ff\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #0090ff;color:#0090ff\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-662c740f43f14\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/two-strings-game-hackerrank-solution\/#Solution_%E2%80%93_Two_Strings_Game_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; Two Strings Game &#8211; HackerRank Solution\">Solution &#8211; Two Strings Game &#8211; HackerRank Solution<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/two-strings-game-hackerrank-solution\/#C\" title=\"C++\">C++<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/two-strings-game-hackerrank-solution\/#Java\" title=\"Java\">Java<\/a><\/li><\/ul><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Two_Strings_Game_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; Two Strings Game &#8211; HackerRank Solution<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"C\"><\/span><strong>C++<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">#include &lt;iostream>\n#include &lt;vector>\n#include &lt;cstdio>\n#include &lt;algorithm>\nusing namespace std;\n \n#define maxn 300000\n#define limit 1000000000000000000LL\n \nlong long k;\n \nint n, m, i, j, cur, bad_value, kk;\nchar a[maxn], b[maxn];\nbool was[30];\npair&lt;int, int> srt[maxn * 2 + 3];\n \nstruct sfa {\n \n    long long dp[maxn * 2 + 3], grundy_sum[30], ways[maxn * 2 + 3];\n \n    int next[maxn * 2 + 3][26], len[maxn * 2 + 3], lnk[maxn * 2 + 3], grundy[maxn * 2 + 3];\n    int nodes, last, j;\n \n    void init () {\n        nodes = last = 1;\n        len[1] = lnk[1] = 0;\n    }\n \n    void push (int c) {\n        int cur = ++nodes, p;\n        len[cur] = len[last] + 1;\n        for(p = last; p &amp;&amp; !next[p][c]; p = lnk[p]) next[p][c] = cur;\n        if (!p) lnk[cur] = 1; else {\n            int q = next[p][c];\n            if (len[p] + 1 == len[q]) lnk[cur] = q; else {\n                int clone = ++nodes;\n                len[clone] = len[p] + 1;\n                for(int j = 0; j &lt; 26; j++) next[clone][j] = next[q][j];\n                lnk[clone] = lnk[q];\n                for(; p &amp;&amp; next[p][c] == q; p = lnk[p]) next[p][c] = clone;\n                lnk[q] = lnk[cur] = clone;\n            }\n        }\n        last = cur;\n    }\n \n    void grundy_precalc () {\n        for(i = 1; i &lt;= nodes; i++) srt[i] = make_pair(len[i], i);\n        sort(srt + 1, srt + nodes + 1);\n        for(i = 1; i &lt;= nodes; i++) {\n            int k = srt[nodes - i + 1].second;\n            dp[k] = 1;\n            for(j = 0; j &lt; 30; j++) was[j] = 0;\n            for(j = 0; j &lt; 26; j++) if (next[k][j]) was[grundy[next[k][j]]] = true;\n            for(j = 0; j &lt; 30; j++) if (!was[j]) {\n                grundy[k] = j;\n                break;\n            }\n        }        \n    }    \n \n    void substr_precalc () {\n        for(i = 1; i &lt;= nodes; i++) srt[i] = make_pair(len[i], i);\n        sort(srt + 1, srt + nodes + 1);\n        for(i = 1; i &lt;= nodes; i++) {\n            int k = srt[nodes - i + 1].second;\n            dp[k] = 1;\n            for(j = 0; j &lt; 26; j++) if (next[k][j]) dp[k] += dp[next[k][j]];\n        }\n        ways[1] = 1;\n        for(i = 1; i &lt;= nodes; i++) for(j = 0; j &lt; 26; j++) if (next[srt[i].second][j]) ways[next[srt[i].second][j]] += ways[srt[i].second];\n        for(i = 1; i &lt;= nodes; i++) grundy_sum[grundy[i]] += ways[i];\n    }\n \n    void dp_recalc (int bad_value) {\n        for(i = 1; i &lt;= nodes; i++) srt[i] = make_pair(len[i], i);\n        sort(srt + 1, srt + nodes + 1);\n        for(i = 1; i &lt;= nodes; i++) {\n            int k = srt[nodes - i + 1].second;\n            dp[k] = grundy[k] != bad_value;\n            for(j = 0; j &lt; 26; j++) if (next[k][j]) dp[k] += dp[next[k][j]];\n        }\n    }\n \n} sfa1, sfa2;\n \nint main (int argc, char * const argv[]) {\n\/\/    freopen(\"input.txt\", \"r\", stdin);\n    scanf(\"%d %d %lld\\n\", &amp;n, &amp;m, &amp;k);\n \n    sfa1.init();\n    sfa2.init();\n \n    for(i = 0; i &lt; n; i++) {\n        a[i] = getchar();\n        while (a[i] &lt; 'a' || a[i] > 'z') a[i] = getchar();\n        sfa1.push(a[i] - 'a');\n    }\n    for(i = 0; i &lt; m; i++) {\n        b[i] = getchar();\n        while (b[i] &lt; 'a' || b[i] > 'z') b[i] = getchar();\n        sfa2.push(b[i] - 'a');\n    }\n \n    sfa1.grundy_precalc();\n    for(i = 1; i &lt;= sfa2.nodes; i++) was[i] = false;\n    sfa2.grundy_precalc();\n \n    sfa2.substr_precalc();    \n \n    for(i = 1; i &lt;= sfa1.nodes; i++) srt[i] = make_pair(sfa1.len[i], i);\n    sort(srt + 1, srt + sfa1.nodes + 1);\n    for(i = 1; i &lt;= sfa1.nodes; i++) {\n        kk = srt[sfa1.nodes - i + 1].second;\n        sfa1.dp[kk] = sfa2.dp[1] - sfa2.grundy_sum[sfa1.grundy[kk]];\n        for(j = 0; j &lt; 26; j++) if (sfa1.next[kk][j]) {\n            sfa1.dp[kk] += sfa1.dp[sfa1.next[kk][j]];\n            if (sfa1.dp[kk] > limit) sfa1.dp[kk] = limit;\n        }\n    }        \n \n    if (k > sfa1.dp[1]) {\n        puts(\"no solution\");\n        return 0;\n    }\n \n    cur = 1;\n    while (k > 0) {\n        if (k &lt;= sfa2.dp[1] - sfa2.grundy_sum[sfa1.grundy[cur]]) break; else k -= sfa2.dp[1] - sfa2.grundy_sum[sfa1.grundy[cur]];\n        for(j = 0; j &lt; 26; j++) if (k > sfa1.dp[sfa1.next[cur][j]]) k -= sfa1.dp[sfa1.next[cur][j]]; else {\n            putchar('a' + j);\n            cur = sfa1.next[cur][j];\n            break;\n        }\n    }\n    puts(\"\");    \n \n    sfa2.dp_recalc(bad_value = sfa1.grundy[cur]);\n    cur = 1;\n    while (k > 0) {\n        if (sfa2.grundy[cur] != bad_value) {\n            --k;\n            if (k == 0) break;\n        }\n        for(j = 0; j &lt; 26; j++) if (k > sfa2.dp[sfa2.next[cur][j]]) k -= sfa2.dp[sfa2.next[cur][j]]; else {\n            putchar('a' + j);\n            cur = sfa2.next[cur][j];\n            break;\n        }\n    }\n    puts(\"\");\n    return 0;\n}\n<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Java\"><\/span><strong>Java<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"java\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n  static final int maxn = 300000;\n  static final long limit = 1000000000000000000l;\n\n  static boolean[] was = new boolean[30];\n  static long[] srt;\n\n  static class Sfa {\n\n    long[] dp;\n    long[] grundySum;\n    long[] ways;\n\n    int[][] next;\n    int[] len;\n    int[] lnk;\n    int[] grundy;\n\n    int nodes, last;\n\n    Sfa(int n) {\n      dp = new long[maxn * 2 + 3];\n      grundySum = new long[30];\n      ways = new long[maxn * 2 + 3];\n\n      next = new int[26][maxn * 2 + 3];\n      len = new int[maxn * 2 + 3];\n      lnk = new int[maxn * 2 + 3];\n      grundy = new int[maxn * 2 + 3];\n\n      nodes = last = 1;\n      len[1] = lnk[1] = 0;\n    }\n\n    void push(int c) {\n      int cur = ++nodes, p;\n      len[cur] = len[last] + 1;\n      for (p = last; (p > 0) &amp;&amp; (next[c][p] == 0); p = lnk[p]) {\n        next[c][p] = cur;\n      }\n      if (p == 0) {\n        lnk[cur] = 1;\n      } else {\n        int q = next[c][p];\n        if (len[p] + 1 == len[q]) {\n          lnk[cur] = q;\n        } else {\n          int clone = ++nodes;\n          len[clone] = len[p] + 1;\n          for (int j = 0; j &lt; 26; j++) {\n            next[j][clone] = next[j][q];\n          }\n          lnk[clone] = lnk[q];\n          for (; (p > 0) &amp;&amp; next[c][p] == q; p = lnk[p]) {\n            next[c][p] = clone;\n          }\n          lnk[q] = lnk[cur] = clone;\n        }\n      }\n      last = cur;\n    }\n\n    void grundyPrecalc() {\n      for (int i = 1; i &lt;= nodes; i++) {\n        srt[i] = ((long)len[i]  &lt;&lt; 32l) | i;\n      }\n      Arrays.sort(srt, 1, nodes + 1);\n      for (int i = 1; i &lt;= nodes; i++) {\n        int k = (int)(srt[nodes - i + 1] &amp; 0xffffffffL);\n        dp[k] = 1;\n        Arrays.fill(was, false);\n        for (int j = 0; j &lt; 26; j++) {\n          if (next[j][k] > 0) {\n            was[grundy[next[j][k]]] = true;\n          }\n        }\n        for (int j = 0; j &lt; 30; j++) {\n          if (!was[j]) {\n            grundy[k] = j;\n            break;\n          }\n        }\n      }\n    }\n\n    void substrPrecalc() {\n      for (int i = 1; i &lt;= nodes; i++) {\n        srt[i] = ((long)len[i]  &lt;&lt; 32l) | i;\n      }\n      Arrays.sort(srt, 1, nodes + 1);\n      for (int i = 1; i &lt;= nodes; i++) {\n        int k = (int)(srt[nodes - i + 1] &amp; 0xffffffffL);\n        dp[k] = 1;\n        for (int j = 0; j &lt; 26; j++) {\n          if (next[j][k] > 0) {\n            dp[k] += dp[next[j][k]];\n          }\n        }\n      }\n      ways[1] = 1;\n      for (int i = 1; i &lt;= nodes; i++) {\n        int k = (int)(srt[i] &amp; 0xffffffffL);\n        for (int j = 0; j &lt; 26; j++) {\n          if (next[j][k] > 0) {\n            ways[next[j][k]] += ways[k];\n          }\n        }\n      }\n      for (int i = 1; i &lt;= nodes; i++) {\n        grundySum[grundy[i]] += ways[i];\n      }\n    }\n\n    void dpRecalc(int badValue) {\n      for (int i = 1; i &lt;= nodes; i++) {\n        srt[i] = ((long)len[i]  &lt;&lt; 32l) | i;\n      }\n      Arrays.sort(srt, 1, nodes + 1);\n      for (int i = 1; i &lt;= nodes; i++) {\n        int k = (int)(srt[nodes - i + 1] &amp; 0xffffffffL);\n        dp[k] = grundy[k] != badValue ? 1 : 0;\n        for (int j = 0; j &lt; 26; j++) {\n          if (next[j][k] > 0) {\n            dp[k] += dp[next[j][k]];\n          }\n        }\n      }\n    }\n  }\n\n  public static void main(String[] args) throws IOException {\n    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n    BufferedWriter bw = new BufferedWriter(new FileWriter(System.getenv(\"OUTPUT_PATH\")));\n\n    StringTokenizer st = new StringTokenizer(br.readLine());\n    int n = Integer.parseInt(st.nextToken());\n    int m = Integer.parseInt(st.nextToken());\n    long k = Long.parseLong(st.nextToken());\n\n    srt = new long[maxn * 2 + 3];\n\n    Sfa sfa1 = new Sfa(n);\n\n    char[] a = br.readLine().toCharArray();\n    for (int i = 0; i &lt; n; i++) {\n      sfa1.push(a[i] - 'a');\n    }\n\n    Sfa sfa2 = new Sfa(n);\n\n    char[] b = br.readLine().toCharArray();\n    for (int i = 0; i &lt; m; i++) {\n      sfa2.push(b[i] - 'a');\n    }\n\n    sfa1.grundyPrecalc();\n    for (int i = 1; i &lt;= (sfa2.nodes > 29 ? 29 : sfa2.nodes); i++) {\n      was[i] = false;\n    }\n\n    sfa2.grundyPrecalc();\n    sfa2.substrPrecalc();\n\n    for (int i = 1; i &lt;= sfa1.nodes; i++) {\n      srt[i] = ((long)sfa1.len[i]  &lt;&lt; 32l) | i;\n    }\n    Arrays.sort(srt, 1, sfa1.nodes + 1);\n    for (int i = 1; i &lt;= sfa1.nodes; i++) {\n      int kk = (int)(srt[sfa1.nodes - i + 1] &amp; 0xffffffffL);\n      sfa1.dp[kk] = sfa2.dp[1] - sfa2.grundySum[sfa1.grundy[kk]];\n      for (int j = 0; j &lt; 26; j++) {\n        if (sfa1.next[j][kk] > 0) {\n          sfa1.dp[kk] += sfa1.dp[sfa1.next[j][kk]];\n          if (sfa1.dp[kk] > limit) {\n            sfa1.dp[kk] = limit;\n          }\n        }\n      }\n    }\n\n    if (k > sfa1.dp[1]) {\n      bw.write(\"no solution\");\n      bw.newLine();\n\n      bw.close();\n      br.close();\n      return;\n    }\n    int cur = 1;\n    while (k > 0) {\n      if (k &lt;= sfa2.dp[1] - sfa2.grundySum[sfa1.grundy[cur]]) {\n        break;\n      } else {\n        k -= sfa2.dp[1] - sfa2.grundySum[sfa1.grundy[cur]];\n      }\n      for (int j = 0; j &lt; 26; j++)\n        if (k > sfa1.dp[sfa1.next[j][cur]])\n          k -= sfa1.dp[sfa1.next[j][cur]];\n        else {\n          bw.write('a' + j);\n          cur = sfa1.next[j][cur];\n          break;\n        }\n    }\n    bw.newLine();\n\n    int badValue = sfa1.grundy[cur];\n    sfa2.dpRecalc(badValue);\n    cur = 1;\n    while (k > 0) {\n      if (sfa2.grundy[cur] != badValue) {\n        --k;\n        if (k == 0) {\n          break;\n        }\n      }\n      for (int j = 0; j &lt; 26; j++) {\n        if (k > sfa2.dp[sfa2.next[j][cur]]) {\n          k -= sfa2.dp[sfa2.next[j][cur]];\n        } else {\n          bw.write('a' + j);\n          cur = sfa2.next[j][cur];\n          break;\n        }\n      }\n    }\n\n    bw.newLine();\n\n    bw.close();\n    br.close();\n  }\n}\n<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/two-strings-game\/problem\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">Two Strings Game<\/a>)<\/strong> is generated by <strong><a href=\"https:\/\/www.hackerrank.com\/\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">HackerRank<\/a><\/strong> but the solution is provided by <strong><a href=\"https:\/\/www.codingbroz.com\/\">CodingBroz<\/a><\/strong>. This tutorial is only for <strong>Educational<\/strong> and <strong>Learning<\/strong> purpose.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this post, we will solve Two Strings Game HackerRank Solution. This problem (Two Strings Game) is a part of HackerRank Problem Solving series.<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[9,190],"tags":[191],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/8244"}],"collection":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=8244"}],"version-history":[{"count":4,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/8244\/revisions"}],"predecessor-version":[{"id":8340,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/8244\/revisions\/8340"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=8244"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=8244"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=8244"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}