{"id":6927,"date":"2022-07-21T23:05:00","date_gmt":"2022-07-21T17:35:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=6927"},"modified":"2022-07-04T13:23:01","modified_gmt":"2022-07-04T07:53:01","slug":"the-tree-of-life-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/the-tree-of-life-hackerrank-solution\/","title":{"rendered":"The Tree Of Life &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>The Tree Of Life HackerRank Solution<\/strong>. This problem <strong>(The Tree Of Life)<\/strong> is a part of <strong>HackerRank Functional Programming<\/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-66380e041e464\" 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-66380e041e464\" 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-tree-of-life-hackerrank-solution\/#Task\" title=\"Task\">Task<\/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\/the-tree-of-life-hackerrank-solution\/#Overview\" title=\"Overview\">Overview<\/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\/the-tree-of-life-hackerrank-solution\/#Problem_statement\" title=\"Problem statement\">Problem statement<\/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\/the-tree-of-life-hackerrank-solution\/#Full_input_specification\" title=\"Full input specification\">Full input specification<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/www.codingbroz.com\/the-tree-of-life-hackerrank-solution\/#Solution_%E2%80%93_The_Tree_Of_Life_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; The Tree Of Life &#8211; HackerRank Solution\">Solution &#8211; The Tree Of Life &#8211; HackerRank Solution<\/a><\/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>This challenge asks you to write a program which computes cellular automata state in a non-standard world. Instead of each cell living on a grid it lives on a binary tree.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Overview\"><\/span>Overview<span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<p>A Cellular Automaton (CA) is a set of&nbsp;<em>cells<\/em>&nbsp;which evolve together in stages. At each stage, a given cell changes according to a given&nbsp;<em>rule<\/em>&nbsp;which depends upon values of cells in its&nbsp;<em>neighborhood<\/em>.<\/p>\n\n\n\n<p>Commonly, CAs consist of a\u00a0<em>grid<\/em>\u00a0of cells so that each cell has a neighborhood of 8 cells.<\/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>1---2---3\r\n|   |   |\r\n4---X---5\r\n|   |   |\r\n6---7---8<\/code><\/pre>\n\n\n\n<p>The dynamics of a CA on a grid is thus determined by a way of mapping all 9 of the values near\u00a0<code>X<\/code>\u00a0to a new value which\u00a0<code>X<\/code>\u00a0takes in the next iteration.<\/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>rule(v(1), ..., v(8), v(X)) = ...<\/code><\/pre>\n\n\n\n<p>An example grid CA is\u00a0<a href=\"http:\/\/en.wikipedia.org\/wiki\/Conway%27s_Game_of_Life\" target=\"_blank\" rel=\"noopener\">Conway&#8217;s\u00a0<em>Game of Life<\/em><\/a>\u00a0which stores boolean values at each cell and has the following update rule:<\/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>Consider the sum N = v(1) + ... + v(8).\r\nIf v(X) then\r\n    If N &lt; 2 : return False\r\n    If N > 3 : return False\r\n    otherwise : return True\r\nelse\r\n    If N == 3 : return True<\/code><\/pre>\n\n\n\n<p>A Game is played by picking an initial state of the grid and updating each cell according to the given rule repeatedly. Conway&#8217;s rule produces startlingly interesting behavior for many initial states\u2014in fact, given an infinite grid there exist starting states which compute an encoding of any computable function. In other words, the Game of Life is&nbsp;<em>Turing complete<\/em>.<\/p>\n\n\n\n<p><strong>Rule encoding<\/strong><\/p>\n\n\n\n<p>CA update rules can be complex, but oftentimes they are serialized to a simple format.<\/p>\n\n\n\n<p>Most of the time there are only finitely many possible CA rules. Rules over binary-valued cells are usually assigned numbers by extending an ordering on the neighborhood of cells. For example, if we consider a linear automaton then the neighborhood of a cell looks like<\/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>1---X---2<\/code><\/pre>\n\n\n\n<p>a rule takes the form<\/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>(v(1), v(X), v(2)) -> {0, 1}<\/code><\/pre>\n\n\n\n<p>and so if we assign an order to the input space we can write any such rule as a binary number<\/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>111 110 101 100 011 010 001 000\r\n-------------------------------\r\n 0   0   0   1   1   1   1   0    \"Rule 30\"\r\n 0   1   1   0   1   1   1   0    \"Rule 110\"<\/code><\/pre>\n\n\n\n<p>Clearly there are 256 such rules and so we can read any 8-bit number as a rule specification for a linear CA over binary values.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Problem_statement\"><\/span>Problem statement<span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<p>Instead of computing a CA on a grid, we&#8217;ll compute a CA on a binary tree. The formulation of CAs above does not depend upon arranging the cells in a grid\u2014we can pick any topology so long as there&#8217;s a notion of the&nbsp;<em>neighborhood<\/em>&nbsp;of a cell.<\/p>\n\n\n\n<p>So the task is to build a CA evaluator on binary trees. A conformant program should take a serialized binary tree and a rule (encoded as an integer) as input. Then, given a sequence of counts of iteration steps and associated &#8220;paths&#8221; into the tree the evaluator must&nbsp;<em>interactively<\/em>&nbsp;print out the binary value stored in the tree at the given path after the specified number of steps.<\/p>\n\n\n\n<p>Importantly, while paths are guaranteed to always be valid, step counts are&nbsp;<em>not guaranteed<\/em>&nbsp;to always be&nbsp;<em>positive<\/em>. We may ask you travel back in time&#8212;though never beyond the beginning of time.<\/p>\n\n\n\n<p><strong>1. Parsing trees<\/strong><\/p>\n\n\n\n<p>The initial state of the binary tree automaton is a non-empty binary tree. A conformant program should parse its initial state from a format like as follows<\/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>X              --> A leaf containing a single \"on\" cell\r\n\r\n.              --> A leaf containing a single \"off\" cell\r\n\r\n(X . .)        --> A branch holding an \"off\" with\r\n                      An \"on\" leaf as the left subtree\r\n                      An \"off\" leaf as the right subtree\r\n\r\n(X . (X . .))  --> A branch with an \"off\" cell with\r\n                      An \"on\" leaf as the left subtree\r\n                      The prior example as the right subtree<\/code><\/pre>\n\n\n\n<p><strong>2. Parsing rules<\/strong><\/p>\n\n\n\n<p>The behavior of the automaton is governed by a choice of update rule operating on the 4-cell (unbiased) neighborhood of each cell. There are thus 2^(2^4) = 2^16 = 65536 possible rules and a conformant program must determine the rule in force by evaluating a given 16 bit code given as an unsigned integer.<\/p>\n\n\n\n<p>In pictures, the (maximal) neighborhood of a cell in a binary tree looks like and is numbered like<\/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>    (1)\r\n     |\r\n    (3)\r\n   \/   \\\r\n (2)   (4)<\/code><\/pre>\n\n\n\n<p>and we&#8217;ll encode each rule as a big-endian 16-bit word beginning with the big encoding the &#8220;all on neighborhood&#8221;<\/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>1111 1110 1101 1100 1011 1010 1001 1000 ...\r\n_    _    _    _    _    _    _    _<\/code><\/pre>\n\n\n\n<p>Here are a few examples:<\/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>Rule 7710: (An analogue of Rule 30)\r\n  (X X X X)   -->   .\r\n  (X X X .)   -->   .\r\n  (X X . X)   -->   .\r\n  (X X . .)   -->   X\r\n  (X . X X)   -->   X\r\n  (X . X .)   -->   X\r\n  (X . . X)   -->   X\r\n  (X . . .)   -->   .\r\n  (. X X X)   -->   .\r\n  (. X X .)   -->   .\r\n  (. X . X)   -->   .\r\n  (. X . .)   -->   X\r\n  (. . X X)   -->   X\r\n  (. . X .)   -->   X\r\n  (. . . X)   -->   X\r\n  (. . . .)   -->   .\r\n\r\nRule 42354:\r\n  (X X X X)   -->   X\r\n  (X X X .)   -->   .\r\n  (X X . X)   -->   X\r\n  (X X . .)   -->   .\r\n  (X . X X)   -->   .\r\n  (X . X .)   -->   X\r\n  (X . . X)   -->   .\r\n  (X . . .)   -->   X\r\n  (. X X X)   -->   .\r\n  (. X X .)   -->   X\r\n  (. X . X)   -->   X\r\n  (. X . .)   -->   X\r\n  (. . X X)   -->   .\r\n  (. . X .)   -->   .\r\n  (. . . X)   -->   X\r\n  (. . . .)   -->   .\r<\/code><\/pre>\n\n\n\n<p><strong>3. Parsing Paths<\/strong><\/p>\n\n\n\n<p>Paths are pointers into a tree. The simplest path is the empty path which points to the root value of the tree. From there, they are merely sequences of directions, left (denoted by the single character\u00a0<code>&lt;<\/code>) and right (denoted by\u00a0<code>><\/code>). Some example paths are<\/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>&#91;&lt;>&lt;&lt;&lt;>&lt;>>]\r\n&#91;>>>&lt;&lt;>&lt;]\r\n&#91;]\r\n&#91;>&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;>]<\/code><\/pre>\n\n\n\n<p>where the third example was the empty path.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Full_input_specification\"><\/span>Full input specification<span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<p>A conformant program works as follows. First, it reads two lines setting up the initial state: a rule integer and a serialized binary tree. The next line contains a natural number,&nbsp;<em>n (1 &lt;= n &lt;= 1100)<\/em>, indicating the number of queries that will be asked.<\/p>\n\n\n\n<p>Then, it begins to execute the&nbsp;<em>n<\/em>&nbsp;queries. It reads a single line indicating the first query and must immediately print out the value stored at the path in the tree after the indicated number of rule iterations followed by a newline. For cells which are &#8220;on&#8221;, emit a&nbsp;<code>X<\/code>&nbsp;and for those which are &#8220;off&#8221; emit a&nbsp;<code>.<\/code>. This repeats&nbsp;<em>n-1<\/em>&nbsp;more times.<\/p>\n\n\n\n<p>An example transcript follows where lines sent from the server are preceeded by\u00a0<code>><\/code>\u00a0and lines returned from the client are preceeded by\u00a0<code>&lt;<\/code>.<\/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>> 42354\r\n> ((. X (. . .)) . (X . (. X X)))\r\n> 6\r\n> 0 &#91;]\r\n&lt; .\r\n> 2 &#91;>&lt;]\r\n&lt; X\r\n> 0 &#91;>&lt;]\r\n&lt; X\r\n> 0 &#91;&lt;>]\r\n&lt; .\r\n> 1 &#91;>&lt;]\r\n&lt; X\r\n> 0 &#91;&lt;>]\r\n&lt; X<\/code><\/pre>\n\n\n\n<p>For rule&nbsp;<code>r<\/code>, number of cases&nbsp;<code>n<\/code>, and step increments&nbsp;<code>s<\/code>&nbsp;we have&nbsp;<code>0 &lt;= r &lt;= 65535<\/code>,&nbsp;<code>1 &lt;= n &lt;= 1100<\/code>, and&nbsp;<code>-1000 &lt;= s &lt;= 1000<\/code>.<\/p>\n\n\n\n<p>To see a bit of what&#8217;s going on behind the scenes, here are snapshots of the first 5 tree states at times [0, 4]<\/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>0 -- ((. X (. . .)) . (X . (. X X)))\r\n1 -- ((X . (. X .)) X (. X (X . X)))\r\n2 -- ((. X (X . X)) . (X X (. X .)))\r\n3 -- ((X . (. X .)) X (X . (X X X)))\r\n4 -- ((. X (X . X)) . (. X (X . X)))<\/code><\/pre>\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>42354\r\n((. X (. . .)) . (X . (. X X)))\r\n6\r\n0 &#91;]\r\n2 &#91;>&lt;]\r\n0 &#91;>&lt;]\r\n0 &#91;&lt;>]\r\n1 &#91;>&lt;]\r\n0 &#91;&lt;>]<\/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>.\r\nX\r\nX\r\n.\r\nX\r\nX<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_The_Tree_Of_Life_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; The Tree Of Life &#8211; HackerRank Solution<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p><strong>Scala<\/strong><\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"scala\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">import java.util.Scanner\n\nimport scala.annotation.tailrec\n\ntrait Tree {\n  def value: Boolean\n\n  def applyRule(rule: Int, parentValue: Boolean = false): Tree\n\n  @tailrec\n  final def changeState(rule: Int, stepCount: Int): Tree = if (stepCount == 0) this else applyRule(rule).changeState(rule, stepCount - 1)\n\n  def atPath(path: List[Char]): Boolean\n\n  protected def nextValue(rule: Int, parentValue: Boolean, leftValue: Boolean, rightValue: Boolean): Boolean = {\n    def toBit(value: Boolean, index: Int) = (if (value) 1 else 0) &lt;&lt; index\n\n    val bit = toBit(parentValue, 3) | toBit(leftValue, 2) | toBit(value, 1) | toBit(rightValue, 0)\n    (rule &amp; (1 &lt;&lt; bit)) != 0\n  }\n}\n\nobject Tree {\n  def parse(s: List[Char]): Tree = {\n    def inner(s: List[Char]): (Tree, List[Char]) = s match {\n      case Nil => (Empty, Nil)\n      case c :: cs => c match {\n        case '.' => (Leaf(false), cs)\n        case 'X' => (Leaf(true), cs)\n        case '(' =>\n          val (left, afterLeft) = inner(cs)\n          val (root, afterRoot) = inner(afterLeft)\n          val (right, afterRight) = inner(afterRoot)\n          (Node(root.value, left, right), afterRight)\n        case _ => inner(cs)\n      }\n    }\n\n    inner(s)._1\n  }\n}\n\ncase class Node(value: Boolean, left: Tree, right: Tree) extends Tree {\n  override def applyRule(rule: Int, parentValue: Boolean): Tree = Node(\n    nextValue(rule, parentValue, left.value, right.value),\n    left.applyRule(rule, value),\n    right.applyRule(rule, value)\n  )\n\n  override def atPath(path: List[Char]): Boolean = path match {\n    case ']' :: _ => value\n    case c :: cs => (if (c == '&lt;') left else right).atPath(cs)\n    case Nil => throw new Exception(\"Wrong path\")\n  }\n}\n\ncase class Leaf(value: Boolean) extends Tree {\n  override def applyRule(rule: Int, parentValue: Boolean): Tree = Leaf(\n    nextValue(rule, parentValue, leftValue = false, rightValue = false)\n  )\n\n  override def atPath(path: List[Char]): Boolean = path match {\n    case ']' :: _ => value\n    case _ => throw new Exception(\"Wrong path\")\n  }\n}\n\nobject Empty extends Tree {\n  override def value: Boolean = throw new Exception(\"Value of empty tree\")\n\n  override def applyRule(rule: Int, parentValue: Boolean): Tree = this\n\n  override def atPath(path: List[Char]): Boolean = throw new Exception(\"atPath of empty tree\")\n}\n\ncase class Rule(n: Int)\n\nobject Solution {\n  def main(args: Array[String]): Unit = {\n    val sc = new Scanner(System.in)\n\n    val rule = sc.nextInt\n    sc.nextLine\n    val s = sc.nextLine\n\n    val root = Tree.parse(s.toList)\n\n    val n = sc.nextInt\n\n    case class Query(initialIndex: Int, time: Int, path: List[Char])\n    @scala.annotation.tailrec\n    def readQueries(rest: Int, time: Int, acc: List[Query]): List[Query] = if (rest == 0) acc\n    else {\n      val stepCount = sc.nextInt\n      val path = sc.nextLine.toList.drop(2)\n\n      val nextTime = time + stepCount\n      readQueries(rest - 1, nextTime, Query(n - rest, nextTime, path) :: acc)\n    }\n\n    val queries = readQueries(n, 0, Nil).sortBy(_.time)\n\n    sc.close()\n\n    case class Answer(initialIndex: Int, value: Boolean)\n    case class Accumulator(tree: Tree, time: Int, answers: List[Answer])\n    val accumulator = queries.foldLeft(Accumulator(root, 0, Nil))((acc, query) => {\n      val tree = acc.tree.changeState(rule, query.time - acc.time)\n      Accumulator(tree, query.time, Answer(query.initialIndex, tree.atPath(query.path)) :: acc.answers)\n    })\n\n    println(accumulator.answers.sortBy(_.initialIndex).map(v => if (v.value) 'X' else '.').mkString(\"\\n\"))\n  }\n}\n<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/the-tree-of-life\/problem?h_r=next-challenge&amp;h_v=zen&amp;h_r=next-challenge&amp;h_v=zen\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">The Tree Of Life<\/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 Tree Of Life HackerRank Solution. This problem (The Tree Of Life) is a part of HackerRank Functional Programming 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,684],"tags":[692],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6927"}],"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=6927"}],"version-history":[{"count":4,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6927\/revisions"}],"predecessor-version":[{"id":6931,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6927\/revisions\/6931"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=6927"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=6927"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=6927"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}