{"id":7382,"date":"2022-08-09T23:10:00","date_gmt":"2022-08-09T17:40:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=7382"},"modified":"2022-08-09T15:52:01","modified_gmt":"2022-08-09T10:22:01","slug":"the-grid-search-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/the-grid-search-hackerrank-solution\/","title":{"rendered":"The Grid Search &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>The Grid Search HackerRank Solution<\/strong>. This problem <strong>(The Grid Search)<\/strong> is a part of <strong>HackerRak 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-662d90744239b\" 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-662d90744239b\" 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\/the-grid-search-hackerrank-solution\/#Task\" title=\"Task\">Task<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/the-grid-search-hackerrank-solution\/#Input_Format\" title=\"Input Format\">Input Format<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/the-grid-search-hackerrank-solution\/#Constraints\" title=\"Constraints\">Constraints<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.codingbroz.com\/the-grid-search-hackerrank-solution\/#Solution_%E2%80%93_The_Grid_Search_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; The Grid Search &#8211; HackerRank Solution\">Solution &#8211; The Grid Search &#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-5\" href=\"https:\/\/www.codingbroz.com\/the-grid-search-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-6\" href=\"https:\/\/www.codingbroz.com\/the-grid-search-hackerrank-solution\/#Python\" title=\"Python\">Python<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/www.codingbroz.com\/the-grid-search-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=\"Task\"><\/span><strong>Task<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Given an array of strings of digits, try to find the occurrence of a given pattern of digits. In the grid and pattern arrays, each string represents a row in the grid. For example, consider the following grid:<\/p>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>1234567890  \r\n0987654321  \r\n1111111111  \r\n1111111111  \r\n2222222222  <\/code><\/pre>\n\n\n\n<p>The pattern array is:<\/p>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>876543  \r\n111111  \r\n111111<\/code><\/pre>\n\n\n\n<p>The pattern begins at the second row and the third column of the grid and continues in the following two rows. The pattern is said to be&nbsp;<em>present<\/em>&nbsp;in the grid. The return value should be&nbsp;<code>YES<\/code>&nbsp;or&nbsp;<code>NO<\/code>, depending on whether the pattern is found. In this case, return&nbsp;<code>YES<\/code>.<\/p>\n\n\n\n<p><strong>Function Description<\/strong><\/p>\n\n\n\n<p>Complete the&nbsp;<em>gridSearch<\/em>&nbsp;function in the editor below. It should return&nbsp;<code>YES<\/code>&nbsp;if the pattern exists in the grid, or&nbsp;<code>NO<\/code>&nbsp;otherwise.<\/p>\n\n\n\n<p>gridSearch has the following parameter(s):<\/p>\n\n\n\n<ul><li><em>string G[R]:<\/em>\u00a0the grid to search<\/li><li><em>string P[r]:<\/em>\u00a0the pattern to search for<\/li><\/ul>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Input_Format\"><\/span><strong>Input Format<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>The first line contains an integer\u00a0<em><strong>t<\/strong><\/em>, the number of test cases.<\/p>\n\n\n\n<p>Each of the\u00a0<em><strong>t<\/strong><\/em>\u00a0test cases is represented as follows:<br>The first line contains two space-separated integers\u00a0<em><strong>R<\/strong><\/em>\u00a0and\u00a0<em><strong>C<\/strong><\/em>, the number of rows in the search grid\u00a0<em><strong>G<\/strong><\/em>\u00a0and the length of each row string.<br>This is followed by\u00a0<em><strong>R<\/strong><\/em>\u00a0lines, each with a string of\u00a0<em><strong>C<\/strong><\/em>\u00a0digits that represent the grid\u00a0<em><strong>G<\/strong><\/em>.<br>The following line contains two space-separated integers,\u00a0<em><strong>r<\/strong><\/em>\u00a0and\u00a0<em><strong>c<\/strong><\/em>, the number of rows in the pattern grid\u00a0<em><strong>P<\/strong><\/em>\u00a0and the length of each pattern row string.<br>This is followed by\u00a0<em><strong>r<\/strong><\/em>\u00a0lines, each with a string of\u00a0<em><strong>c<\/strong><\/em>\u00a0digits that represent the pattern grid\u00a0<em><strong>P<\/strong><\/em>.<\/p>\n\n\n\n<p><strong>Returns<\/strong><\/p>\n\n\n\n<ul><li><em>string:<\/em>\u00a0either\u00a0<code>YES<\/code>\u00a0or\u00a0<code>NO<\/code><\/li><\/ul>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Constraints\"><\/span><strong>Constraints<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<ul><li><strong>1 &lt;= <em>t<\/em> &lt;= 5<\/strong><\/li><li><strong>1 &lt;= <em>R<\/em>, <em>r<\/em>, <em>C<\/em>, <em>c<\/em> &lt;= 1000<\/strong><\/li><li><strong>1 &lt;= <em>r<\/em> &lt;= <em>R<\/em><\/strong><\/li><li><strong>1 &lt;= <em>c<\/em> &lt;= <em>C<\/em><\/strong><\/li><\/ul>\n\n\n\n<p><strong>Sample Input<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>2\r\n10 10\r\n7283455864\r\n6731158619\r\n8988242643\r\n3830589324\r\n2229505813\r\n5633845374\r\n6473530293\r\n7053106601\r\n0834282956\r\n4607924137\r\n3 4\r\n9505\r\n3845\r\n3530\r\n15 15\r\n400453592126560\r\n114213133098692\r\n474386082879648\r\n522356951189169\r\n887109450487496\r\n252802633388782\r\n502771484966748\r\n075975207693780\r\n511799789562806\r\n404007454272504\r\n549043809916080\r\n962410809534811\r\n445893523733475\r\n768705303214174\r\n650629270887160\r\n2 2\r\n99\r\n99<\/code><\/pre>\n\n\n\n<p><strong>Sample Output<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>YES\r\nNO<\/code><\/pre>\n\n\n\n<p><strong>Explanation<\/strong><\/p>\n\n\n\n<p>The first test in the input file is:<\/p>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>10 10\r\n7283455864\r\n6731158619\r\n8988242643\r\n3830589324\r\n2229505813\r\n5633845374\r\n6473530293\r\n7053106601\r\n0834282956\r\n4607924137\r\n3 4\r\n9505\r\n3845\r\n3530<\/code><\/pre>\n\n\n\n<p>The pattern is present in the larger grid as marked in bold below.<\/p>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>7283455864  \r\n6731158619  \r\n8988242643  \r\n3830589324  \r\n2229505813  \r\n5633845374  \r\n6473530293  \r\n7053106601  \r\n0834282956  \r\n4607924137  <\/code><\/pre>\n\n\n\n<p>The second test in the input file is:<\/p>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>15 15\r\n400453592126560\r\n114213133098692\r\n474386082879648\r\n522356951189169\r\n887109450487496\r\n252802633388782\r\n502771484966748\r\n075975207693780\r\n511799789562806\r\n404007454272504\r\n549043809916080\r\n962410809534811\r\n445893523733475\r\n768705303214174\r\n650629270887160\r\n2 2\r\n99\r\n99<\/code><\/pre>\n\n\n\n<p>The search pattern is:<\/p>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>99\r\n99<\/code><\/pre>\n\n\n\n<p>This pattern is not found in the larger grid.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_The_Grid_Search_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; The Grid Search &#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;cmath>\n#include &lt;cstdio>\n#include &lt;vector>\n#include &lt;iostream>\n#include &lt;algorithm>\nusing namespace std;\n\nint main(){\n    int t;\n    cin >> t;\n    for(int a0 = 0; a0 &lt; t; a0++){\n        int R;\n        int C;\n        cin >> R >> C;\n        vector&lt;string> G(R);\n        for(int G_i = 0;G_i &lt; R;G_i++){\n           cin >> G[G_i];\n        }\n        int r;\n        int c;\n        cin >> r >> c;\n        vector&lt;string> P(r);\n        for(int P_i = 0;P_i &lt; r;P_i++){\n           cin >> P[P_i];\n        }\n        \/\/ Optimization - continue if P > G\n        if(r > R || c > C) {\n            cout&lt;&lt;\"NO\\n\";\n            continue;\n        }\n        bool patternExists = false;\n        \/\/ Main algorithm\n        for(int i = 0; i &lt; R; i++) {\n            bool foundMatch = false;\n            for(int j = 0; j &lt; C; j++) {\n                if(G[i][j] == P[0][0] &amp;&amp; (i+r &lt;= R) &amp;&amp; (j+c &lt;= C)) {\n                    \/\/ Potential match\n                    bool match = true;\n                    for(int x = 0; x &lt; r; x++) {\n                        bool rowMatch = true;\n                        for(int y = 0; y &lt; c; y++) {\n                            if(P[x][y] != G[x+i][y+j]) {\n                                rowMatch = false;\n                                match = false;\n                                break;\n                            }\n                        }\n                        if(!rowMatch) {\n                            break;\n                        }\n                    }\n                    if(match) {\n                        foundMatch = true;\n                        break;\n                    }\n                }\n            }\n            if(foundMatch) {\n                patternExists = true;\n                break;\n            }\n        }\n        if(patternExists) {\n            cout&lt;&lt;\"YES\\n\";\n        } else {\n            cout&lt;&lt;\"NO\\n\";\n        }\n    }\n    return 0;\n}\n<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Python\"><\/span><strong>Python<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">import sys\nimport re\n\ndef occurrences(string, sub):\n    res = []\n    ind = 0\n    while ind &lt; len(string) - len(sub) + 1:\n        found = string.find(sub, ind)\n        #print(\"ind = {} found = {}\".format(ind, found))\n        if found != -1:\n            res.append(found)\n            ind = found + 1\n        else:\n            break\n    return res\n\ndef gridSearch(G, P):\n    for ind_g in range(len(G) - len(P) + 1):\n        cur = -1\n        all_occurrences = []\n        for ind_p, s_pat in enumerate(P):\n            all_occurrences.append(occurrences(G[ind_g + ind_p], s_pat))\n            #ret = G[ind_g + ind_p].find(s_pat)\n            #print(\"ind_g = {} ind_p = {} check {} in {}\".format(ind_g, ind_p, s_pat, G[ind_g + ind_p]))\n            \n            #if ret == -1 or (ind_p > 0 and cur != ret):\n            #    break\n            #elif ind_p == len(P) - 1:\n            #    return 'YES'\n            #else:\n            #    cur = ret\n        \n        #print(all_occurrences)\n        ourset = set(all_occurrences[0])\n        for lst in all_occurrences:\n            ourset &amp;= set(lst)\n            \n        #print(\"ourset = {}\".format(ourset))\n        if len(ourset) >= 1:\n            return 'YES'\n            \n    \n    return 'NO'\n        \n\nif __name__ == \"__main__\":\n    t = int(input().strip())\n    for a0 in range(t):\n        R, C = input().strip().split(' ')\n        R, C = [int(R), int(C)]\n        G = []\n        G_i = 0\n        for G_i in range(R):\n            G_t = str(input().strip())\n            G.append(G_t)\n        r, c = input().strip().split(' ')\n        r, c = [int(r), int(c)]\n        P = []\n        P_i = 0\n        for P_i in range(r):\n            P_t = str(input().strip())\n            P.append(P_t)\n        result = gridSearch(G, P)\n        print(result)\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    public static boolean isMatch(String[] grid, int r, int c, String[] pattern) {\n        for(int i = r; i &lt; r + pattern.length; i++) {\n            if(!grid[i].substring(c, c + pattern[0].length()).equals(pattern[i - r]))\n                return false;\n        }\n        return true;\n    }\n\n    public static void main(String[] args) {\n        \/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your clas should be named Solution. *\/\n        Scanner sc = new Scanner(System.in);\n        int T = sc.nextInt();\n        for(int k = 0; k &lt; T; k++){\n            int R = sc.nextInt();\n        int C = sc.nextInt();\n        String[] grid = new String[R];\n        for(int i = 0; i &lt; R; i++){\n            grid[i] = sc.next();\n        }\n        int r = sc.nextInt();\n        int c = sc.nextInt();\n        String[] pattern = new String[r];\n        for(int i = 0; i &lt; r; i++) {\n            pattern[i] = sc.next();\n        }\n        boolean ret = false;\n        for(int i = 0; i &lt;= R - r; i++){\n            for(int j = 0; j &lt;= C - c; j++){\n                if(grid[i].charAt(j) == pattern[0].charAt(0)){\n                    ret = isMatch(grid, i, j, pattern);\n                    if(ret)\n                        break;\n                }\n            }\n            if(ret)\n                break;\n        }\n        if(ret){\n            System.out.println(\"YES\");\n        }\n        else{\n            System.out.println(\"NO\");\n        }\n        }\n    }\n}\n<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/the-grid-search\/problem\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">The Grid Search<\/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 The Grid Search HackerRank Solution. This problem (The Grid Search) is a part of HackerRak 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\/7382"}],"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=7382"}],"version-history":[{"count":3,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7382\/revisions"}],"predecessor-version":[{"id":7386,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7382\/revisions\/7386"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=7382"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=7382"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=7382"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}