{"id":6789,"date":"2022-07-01T23:25:00","date_gmt":"2022-07-01T17:55:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=6789"},"modified":"2022-06-30T19:27:28","modified_gmt":"2022-06-30T13:57:28","slug":"is-graph-bipartite-leetcode-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/is-graph-bipartite-leetcode-solution\/","title":{"rendered":"Is Graph Bipartite? &#8211; Leetcode Solution"},"content":{"rendered":"\n<p>In this post, we are going to solve the<strong> 785. Is Graph Bipartite?<\/strong> problem of Leetcode. This problem <strong>785. Is Graph Bipartite?<\/strong> is a Leetcode <strong>medium <\/strong>level problem. Let&#8217;s see the code, <strong><strong>785. Is Graph Bipartite?<\/strong><\/strong> <strong>&#8211; Leetcode Solution<\/strong>.<\/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-662e808eb21c0\" 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-662e808eb21c0\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><ul class='ez-toc-list-level-2' ><li class='ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/is-graph-bipartite-leetcode-solution\/#Problem\" title=\"Problem\">Problem<\/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\/is-graph-bipartite-leetcode-solution\/#Example_1\" title=\"Example 1 :\">Example 1 :<\/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\/is-graph-bipartite-leetcode-solution\/#Example_2\" title=\"Example 2 :\">Example 2 :<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.codingbroz.com\/is-graph-bipartite-leetcode-solution\/#Constraints\" title=\"Constraints\">Constraints<\/a><\/li><\/ul><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-1'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/www.codingbroz.com\/is-graph-bipartite-leetcode-solution\/#Is_Graph_Bipartite_%E2%80%93_Leetcode_Solution\" title=\"Is Graph Bipartite? &#8211; Leetcode Solution\">Is Graph Bipartite? &#8211; Leetcode Solution<\/a><ul class='ez-toc-list-level-4' ><li class='ez-toc-heading-level-4'><ul class='ez-toc-list-level-4' ><li class='ez-toc-heading-level-4'><ul class='ez-toc-list-level-4' ><li class='ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/www.codingbroz.com\/is-graph-bipartite-leetcode-solution\/#Using_BFS_traversal\" title=\"Using BFS traversal\">Using BFS traversal<\/a><\/li><\/ul><\/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\/is-graph-bipartite-leetcode-solution\/#785_Is_Graph_Bipartite_%E2%80%93_Solution_in_Java\" title=\" 785. Is Graph Bipartite? &#8211; Solution in Java\"> 785. Is Graph Bipartite? &#8211; Solution in Java<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-8\" href=\"https:\/\/www.codingbroz.com\/is-graph-bipartite-leetcode-solution\/#785_Is_Graph_Bipartite_%E2%80%93_Solution_in_C\" title=\" 785. Is Graph Bipartite? &#8211; Solution in C++\"> 785. Is Graph Bipartite? &#8211; Solution in C++<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-9\" href=\"https:\/\/www.codingbroz.com\/is-graph-bipartite-leetcode-solution\/#785_Is_Graph_Bipartite_%E2%80%93_Solution_in_Python\" title=\" 785. Is Graph Bipartite? &#8211; Solution in Python\"> 785. Is Graph Bipartite? &#8211; Solution in Python<\/a><ul class='ez-toc-list-level-4' ><li class='ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-10\" href=\"https:\/\/www.codingbroz.com\/is-graph-bipartite-leetcode-solution\/#Using_DFS_traversal\" title=\"Using DFS traversal\">Using DFS traversal<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-11\" href=\"https:\/\/www.codingbroz.com\/is-graph-bipartite-leetcode-solution\/#785_Is_Graph_Bipartite_%E2%80%93_Solution_in_Java-2\" title=\" 785. Is Graph Bipartite? &#8211; Solution in Java\"> 785. Is Graph Bipartite? &#8211; Solution in Java<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-12\" href=\"https:\/\/www.codingbroz.com\/is-graph-bipartite-leetcode-solution\/#785_Is_Graph_Bipartite_%E2%80%93_Solution_in_C-2\" title=\"785. Is Graph Bipartite? &#8211; Solution in C++\">785. Is Graph Bipartite? &#8211; Solution in C++<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-13\" href=\"https:\/\/www.codingbroz.com\/is-graph-bipartite-leetcode-solution\/#785_Is_Graph_Bipartite_%E2%80%93_Solution_in_Python-2\" title=\" 785. Is Graph Bipartite? &#8211; Solution in Python\"> 785. Is Graph Bipartite? &#8211; Solution in Python<\/a><\/li><\/ul><\/li><\/ul><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Problem\"><\/span><strong>Problem<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>There is an<strong> undirected<\/strong> graph with n nodes, where each node is numbered between <code>0<\/code> and <code>n - 1<\/code>. You are given a 2D array graph, where <code><strong>graph[u]<\/strong><\/code> is an array of nodes that node<code> u<\/code> is adjacent to. More formally, for each<code> v<\/code> in <code>graph[u]<\/code>, there is an undirected edge between node <code>u<\/code> and node <code>v<\/code>. The graph has the following properties:<\/p>\n\n\n\n<ul><li>There are no self-edges (<code><strong>graph[u]<\/strong><\/code> does not contain <code>u<\/code>).<\/li><li>There are no parallel edges (<code><strong>graph[u]<\/strong><\/code> does not contain duplicate values).<\/li><li>If <code><strong>v<\/strong><\/code> is in <code><strong>graph[u]<\/strong><\/code>, then <code><strong>u<\/strong><\/code> is in <code><strong>graph[v]<\/strong><\/code> (the graph is undirected).<\/li><li>The graph may not be connected, meaning there may be two nodes <code>u<\/code> and<code> v<\/code> such that there is no path between them.<\/li><li>A graph is bipartite if the nodes can be partitioned into two independent sets A and B such that every edge in the graph connects a node in set A and a node in set B.<\/li><\/ul>\n\n\n\n<p>Return <strong><code>true<\/code><\/strong> if and only if it is <strong><em>bipartite<\/em><\/strong>.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Example_1\"><\/span><strong>Example 1 :<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\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>Input: graph = &#91;&#91;1,2,3],&#91;0,2],&#91;0,1,3],&#91;0,2]]\r\nOutput: false\r\nExplanation: There is no way to partition the nodes into two independent sets such that every edge connects a node in one and a node in the other.<\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Example_2\"><\/span><strong>Example 2 :<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\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>Input: graph = &#91;&#91;1,3],&#91;0,2],&#91;1,3],&#91;0,2]]\r\nOutput: true\r\nExplanation: We can partition the nodes into two sets: {0, 2} and {1, 3}.<\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Constraints\"><\/span><strong>Constraints<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<ul><li><code>graph.length<\/code> == n<\/li><li>1 &lt;= n &lt;= 100<\/li><li>0 &lt;= <code>graph[u].length<\/code> &lt; n<\/li><li>0 &lt;= <code>graph[u][i] <\/code>&lt;= n &#8211; 1<\/li><li><code>graph[u]<\/code> does not contain u.<\/li><li>All the values of <code>graph[u]<\/code> are unique.<\/li><li>If <code>graph[u]<\/code> contains v, then<code> graph[v]<\/code> contains u.<\/li><\/ul>\n\n\n\n<p>Now, let&#8217;s see the code of <strong>785. Is Graph Bipartite?<\/strong> &#8211; Leetcode Solution.<\/p>\n\n\n\n<h1 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Is_Graph_Bipartite_%E2%80%93_Leetcode_Solution\"><\/span><strong><strong>Is Graph Bipartite?<\/strong> &#8211; Leetcode Solution<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h1>\n\n\n\n<p>We are going to solve the problem using Graph Data structure and will solve this problem using both <strong>BFS &#8211; Breadth First Search<\/strong> traversal as well <strong>DFS &#8211; Depth First Search<\/strong> Traversal. Let&#8217;s see the solution.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Using_BFS_traversal\"><\/span><strong>Using BFS traversal<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h4>\n\n\n\n<p>First, we are going to see the solution to this problem using the BFS traversal of Graph.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"785_Is_Graph_Bipartite_%E2%80%93_Solution_in_Java\"><\/span><strong><strong><strong> 785. Is Graph Bipartite?<\/strong><\/strong> &#8211; Solution<\/strong> <strong>in 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=\"\">class Solution {\n    \n    public boolean findBipartite(int i, int[][] graph,int[] color){\n        Queue&lt;Integer> q = new LinkedList&lt;>();\n        q.add(i);\n        color[i] = 1;\n        \n        while(!q.isEmpty()){\n            int node = q.poll();\n            for(int e : graph[node]){\n                if(color[e] == -1){\n                    color[e] = 1 - color[node];\n                    q.add(e);\n                } else if(color[e] == color[node]){\n                    return false;\n                }\n            }\n        }\n        return true;\n    }\n    public boolean isBipartite(int[][] graph) {\n        int[] color = new int[graph.length];\n        for(int i=0;i&lt;graph.length;i++) color[i] = -1;\n        \n        for(int i=0; i&lt;graph.length ;i++){\n            if(color[i] == -1){\n                if(!findBipartite(i,graph,color)) return false;\n            }\n        }\n        return true;\n    }\n}<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"785_Is_Graph_Bipartite_%E2%80%93_Solution_in_C\"><\/span><strong><strong><strong><strong> 785. Is Graph Bipartite?<\/strong><\/strong> &#8211; Solution<\/strong> <strong>in <\/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=\"\">class Solution {\n\nbool isBipartite(vector&lt;vector&lt;int>>&amp; graph) {\n    int n = graph.size();\n    vector&lt;int> color(n); \/\/ 0: uncolored; 1: color A; -1: color B\n        \n    queue&lt;int> q; \n\t\n    for (int i = 0; i &lt; n; i++) {\n      if (color[i]) continue;\n      \n\n      color[i] = 1;\n      for (q.push(i); !q.empty(); q.pop()) {\n        int cur = q.front();\n        for (int neighbor : graph[cur]) \n\t\t{\n          if (!color[neighbor]) \n          { color[neighbor] = -color[cur]; q.push(neighbor); } \n\t\t  \n          else if (color[neighbor] == color[cur]) \n            return false;\n        }        \n      }\n    }\n    \n    return true;\n  }\n\n}<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"785_Is_Graph_Bipartite_%E2%80%93_Solution_in_Python\"><\/span><strong><strong><strong><strong><strong> 785. Is Graph Bipartite?<\/strong><\/strong> &#8211; Solution<\/strong> <strong>in <\/strong>Python<\/strong><\/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=\"\">def isBipartite(self, graph):\n        \"\"\"\n        :type graph: List[List[int]]\n        :rtype: bool\n        \"\"\"\n        n, colored = len(graph), {}\n        for i in range(n):\n            if i not in colored and graph[i]:\n                colored[i] = 1\n                q = collections.deque([i])\n                while q:\n                    cur = q.popleft()\n                    for nb in graph[cur]:\n                        if nb not in colored:\n                            colored[nb] = -colored[cur]\n                            q.append(nb)\n                        elif colored[nb] == colored[cur]:\n                            return False\n        return True<\/pre>\n\n\n\n<p>These were the solution to the problem, <strong><strong>785. Is Graph Bipartite?<\/strong><\/strong> <strong>&#8211; Leetcode Solution<\/strong> using the BFS traversal on graph approach. Now, we are going to solve this problem using the DFS traversal approach.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Using_DFS_traversal\"><\/span><strong>Using DFS traversal<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h4>\n\n\n\n<p>First, we are going to see the solution to this problem using the DFS traversal of Graph.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"785_Is_Graph_Bipartite_%E2%80%93_Solution_in_Java-2\"><\/span><strong><strong><strong> 785. Is Graph Bipartite?<\/strong><\/strong> &#8211; Solution<\/strong> <strong>in 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=\"\">class Solution {\n    \n    public boolean findBipartite(int i, int[][] graph,int[] color){\n       if(color[i] == -1) color[i] = 1;\n       for(int e : graph[i]){\n           if(color[e] == -1){\n                color[e] = 1 - color[i];\n                if(!findBipartite(e,graph,color)) return false;\n           } else if(color[e] != -1){\n               if(color[e] == color[i]) return false;\n           }\n           \n       } \n        return true;\n    }\n    public boolean isBipartite(int[][] graph) {\n        int[] color = new int[graph.length];\n        for(int i=0;i&lt;graph.length;i++) color[i] = -1;\n        \n        for(int i=0; i&lt;graph.length ;i++){\n            if(color[i] == -1){\n                if(!findBipartite(i,graph,color)) return false;\n            }\n        }\n        return true;\n    }\n}<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"785_Is_Graph_Bipartite_%E2%80%93_Solution_in_C-2\"><\/span><strong><strong><strong><strong>785. Is Graph Bipartite?<\/strong><\/strong> &#8211; Solution<\/strong> <strong>in <\/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=\"\">class Solution {\npublic:\n    vector&lt;int>vis,col;\n    bool dfs(int v, int c, vector&lt;vector&lt;int>>&amp; graph){\n        vis[v]=1;\n        col[v]=c;\n        for(int child:graph[v]){\n            if(vis[child]==0){\n                \/\/ here c^1 is for flipping 1 by 0 or 0 by 1, that is flip the current color\n                if(dfs(child,c^1,graph)==false) \n                    return false;\n            }\n            else{\n                if(col[v]==col[child])\n                    return false;\n            }\n        }\n        return true;\n    }\n    \n    bool isBipartite(vector&lt;vector&lt;int>>&amp; graph) {\n        int n=graph.size();\n        vis.resize(n);\n        col.resize(n);\n\n        for(int i=0;i&lt;n;++i){\n            if(vis[i]==0 &amp;&amp; dfs(i,0,graph)==false){ \n                return false;\n            }\n        }\n        \n        return true;\n    }\n};<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"785_Is_Graph_Bipartite_%E2%80%93_Solution_in_Python-2\"><\/span><strong><strong><strong><strong><strong> 785. Is Graph Bipartite?<\/strong><\/strong> &#8211; Solution<\/strong> <strong>in <\/strong>Python<\/strong><\/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=\"\">    def isBipartite(self, graph):\n        \"\"\"\n        :type graph: List[List[int]]\n        :rtype: bool\n        \"\"\"\n        n, colored = len(graph), {}\n        def dfs_color(color, idx, graph, colored):\n            if idx in colored:\n                return color == colored[idx]\n            colored[idx] = color                            \n            return all(dfs_color(-color, nb, graph, colored) for nb in graph[idx])\n    \n        return all(i in colored or dfs_color(1, i, graph, colored) for i in range(n)) <\/pre>\n\n\n\n<p>These were the solution to problem <strong>785. Is Graph Bipartite? &#8211; Leetcode solution<\/strong> using the DFS traversal on graph approach. <\/p>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong><a href=\"https:\/\/leetcode.com\/problems\/is-graph-bipartite\/\" target=\"_blank\" rel=\"noreferrer noopener\">785. Is Graph Bipartite? &#8211; Leetcode solution<\/a><\/strong> is generated by <strong><a href=\"https:\/\/leetcode.com\/\" target=\"_blank\" rel=\"noreferrer noopener\">Leetcode<\/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 are going to solve the 785. Is Graph Bipartite? problem of Leetcode. This problem 785. Is Graph Bipartite? is a Leetcode medium level problem. Let&#8217;s see the code, 785. Is Graph Bipartite? &#8211; Leetcode Solution.<\/p>\n","protected":false},"author":3,"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":[688],"tags":[694,130,689],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6789"}],"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\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=6789"}],"version-history":[{"count":2,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6789\/revisions"}],"predecessor-version":[{"id":6792,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6789\/revisions\/6792"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=6789"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=6789"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=6789"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}