{"id":41,"date":"2019-02-06T04:29:59","date_gmt":"2019-02-06T04:29:59","guid":{"rendered":"https:\/\/www.kindsonthegenius.com\/coding\/?p=41"},"modified":"2019-02-06T04:29:59","modified_gmt":"2019-02-06T04:29:59","slug":"question-5-find-largest-sub-array","status":"publish","type":"post","link":"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/","title":{"rendered":"Question 5 – Find Largest Sub-array"},"content":{"rendered":"

Question 5<\/h4>\n

You are given an unsorted array of integers. You\u00a0 need to find the largest sub-array formed by consecutive numbers. The sub-array should only contain unique values. For example<\/p>\n

Input:\u00a0<\/strong>{2, 7, 2, 1, 4, 3, 5, 0}<\/p>\n

Output:\u00a0<\/strong>The largest subarray is from index 2 to 7<\/p>\n

The sub-array is {2, 1, 4, 3, 5}<\/p>\n

 <\/p>\n

Solution\u00a0<\/strong><\/h4>\n

The approach is to iterate through the array. Then we keep track of the largest sub-array seen so far. We also make sure that the integers in the sub-array is consecutive.<\/p>\n

For the sub-array elements to be consecutive, then:<\/p>\n

    \n
  • the difference between the largest and smallest element must be equal to the length of the sub-array minus one<\/li>\n
  • we check the the elements are unique track tracking the already visited element in another array.<\/li>\n<\/ul>\n

    The Java code is given below:<\/p>\n

     <\/p>\n

    <\/p>\n

    \/*<\/span>\r\n * Find the largest consecutive sub-array<\/span>\r\n * Written by: Kindson The Genius<\/span>\r\n *\/<\/span>\r\npublic<\/span> class<\/span> LargestSubarray<\/span> {<\/span>\r\n\t\r\n\t\/\/helper function to check if sub-array is consecutive<\/span>\r\n\tstatic<\/span> boolean<\/span> isConsecutive<\/span>(<\/span>int<\/span> A[],<\/span> int<\/span> i,<\/span> int<\/span> j,<\/span> int<\/span> min,<\/span> int<\/span> max)<\/span> \r\n\t{<\/span>\r\n\t\tif<\/span>(<\/span>max -<\/span> min !=<\/span> j -<\/span> i)<\/span> {<\/span>\r\n\t\t\treturn<\/span> false<\/span>;<\/span>\r\n\t\t}<\/span>\r\n\t\t\r\n\t\t\/\/track the visited elements<\/span>\r\n\t\tboolean<\/span> visited[]<\/span> =<\/span> new<\/span> boolean<\/span>[<\/span>j -<\/span> i +<\/span> 1<\/span>];<\/span>\r\n\t\t\r\n\t\tfor<\/span>(<\/span>int<\/span> k =<\/span> i;<\/span> k <=<\/span> j;<\/span> k++)<\/span> {<\/span>\r\n\t\t\tif<\/span>(<\/span>visited[<\/span>A[<\/span>k]<\/span> -<\/span> min])<\/span> {<\/span>\r\n\t\t\t\treturn<\/span> false<\/span>;<\/span>\r\n\t\t\t}<\/span>\r\n\t\t\r\n\t\t\tvisited[<\/span>A[<\/span>k]<\/span> -<\/span> min]<\/span> =<\/span> true<\/span>;<\/span>\t\t\r\n\t\t}<\/span>\r\n\t\treturn<\/span> true<\/span>;<\/span>\r\n\t}<\/span>\r\n\t\r\n\t\r\n\tpublic<\/span> static<\/span> void<\/span> findMaxSubarray<\/span>(<\/span>int<\/span>[]<\/span> A)<\/span> {<\/span>\r\n\t\tint<\/span> len =<\/span> 1<\/span>;<\/span>\r\n\t\tint<\/span> start =<\/span> 0<\/span>;<\/span>\r\n\t\tint<\/span> end =<\/span> 0<\/span>;<\/span>\r\n\t\t\r\n\t\t\/\/Loop through all the elements of the array<\/span>\r\n\t\tfor<\/span>(<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> A.<\/span>length<\/span> -<\/span> 1<\/span>;<\/span> i++)<\/span> {<\/span>\r\n\t\t\tint<\/span> min_val =<\/span> A[<\/span>i];<\/span>\r\n\t\t\tint<\/span> max_val =<\/span> A[<\/span>i];<\/span>\r\n\t\t\t\r\n\t\t\t\/\/Loop through the current sub-array<\/span>\r\n\t\t\tfor<\/span>(<\/span>int<\/span> j =<\/span> i;<\/span> j <<\/span> A.<\/span>length<\/span>;<\/span> j++)<\/span> \r\n\t\t\t{<\/span>\r\n\t\t\t\tmin_val =<\/span> Math.<\/span>min<\/span>(<\/span>min_val,<\/span> A[<\/span>j]);<\/span>\r\n\t\t\t\tmax_val =<\/span> Math.<\/span>max<\/span>(<\/span>max_val,<\/span> A[<\/span>j]);<\/span>\r\n\t\t\t\t\r\n\t\t\t\t\/\/check the the elements are consecutive<\/span>\r\n\t\t\t\tif<\/span>(<\/span>isConsecutive(<\/span>A,<\/span> i,<\/span> j,<\/span> min_val,<\/span> max_val))<\/span> {<\/span>\r\n\t\t\t\t\tif<\/span>(<\/span>len <<\/span> max_val -<\/span> min_val +<\/span> 1<\/span>)<\/span> {<\/span>\r\n\t\t\t\t\t\tlen =<\/span> max_val -<\/span> min_val +<\/span> 1<\/span>;<\/span>\r\n\t\t\t\t\t\tstart =<\/span> i;<\/span>\r\n\t\t\t\t\t\tend =<\/span> j;<\/span>\r\n\t\t\t\t\t}<\/span>\r\n\t\t\t\t}<\/span>\r\n\t\t\t}<\/span>\r\n\t\t}<\/span>\r\n\t\t\r\n\t\tSystem.<\/span>out<\/span>.<\/span>println<\/span>(<\/span>\"The largest subarray is from index \"<\/span>\r\n\t\t\t\t+<\/span> start +<\/span> \" to \"<\/span> +<\/span> end);<\/span>\r\n\t}<\/span>\r\n\t\r\n\t\/\/Test the program<\/span>\r\n\tpublic<\/span> static<\/span> void<\/span> main<\/span>(<\/span>String[]<\/span> args)<\/span> {<\/span>\r\n\t\tint<\/span>[]<\/span> A =<\/span> {<\/span>2<\/span>,<\/span> 7<\/span>,<\/span> 2<\/span>,<\/span> 1<\/span>,<\/span> 4<\/span>,<\/span> 3<\/span>,<\/span> 5<\/span>,<\/span> 0<\/span>};<\/span>\r\n\t\tfindMaxSubarray(<\/span>A);<\/span>\r\n\t}<\/span>\r\n\r\n}<\/span>\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"
    Question 5 You are given an unsorted array of integers. You\u00a0 need to find the largest sub-array formed by consecutive numbers. The sub-array should only … <\/p>\n","protected":false},"author":395,"featured_media":42,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[8,2,3],"tags":[18],"class_list":["post-41","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-array","category-coding-challenge","category-java","tag-largest-sub-array"],"yoast_head":"\nQuestion 5 - Find Largest Sub-array - Coding Challenge<\/title>\n<meta name=\"description\" content=\"Given an array of integers which are unsorted, you need to find the largest sub-array made up of consecutive integers. The elements must be unique\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Question 5 - Find Largest Sub-array - Coding Challenge\" \/>\n<meta property=\"og:description\" content=\"Given an array of integers which are unsorted, you need to find the largest sub-array made up of consecutive integers. The elements must be unique\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/\" \/>\n<meta property=\"og:site_name\" content=\"Coding Challenge\" \/>\n<meta property=\"article:published_time\" content=\"2019-02-06T04:29:59+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Largest-Sub-array.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"927\" \/>\n\t<meta property=\"og:image:height\" content=\"496\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"author\" content=\"kindsonthegenius\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"kindsonthegenius\" \/>\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:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/question-5-find-largest-sub-array\\\/#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/question-5-find-largest-sub-array\\\/\"},\"author\":{\"name\":\"kindsonthegenius\",\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/#\\\/schema\\\/person\\\/63a68934672db675ff0cd80d066510c2\"},\"headline\":\"Question 5 – Find Largest Sub-array\",\"datePublished\":\"2019-02-06T04:29:59+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/question-5-find-largest-sub-array\\\/\"},\"wordCount\":129,\"commentCount\":0,\"image\":{\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/question-5-find-largest-sub-array\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/wp-content\\\/uploads\\\/sites\\\/4\\\/2019\\\/02\\\/Largest-Sub-array.jpg\",\"keywords\":[\"Largest Sub-array\"],\"articleSection\":[\"Array\",\"Coding Challenge\",\"Java\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/question-5-find-largest-sub-array\\\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/question-5-find-largest-sub-array\\\/\",\"url\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/question-5-find-largest-sub-array\\\/\",\"name\":\"Question 5 - Find Largest Sub-array - Coding Challenge\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/question-5-find-largest-sub-array\\\/#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/question-5-find-largest-sub-array\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/wp-content\\\/uploads\\\/sites\\\/4\\\/2019\\\/02\\\/Largest-Sub-array.jpg\",\"datePublished\":\"2019-02-06T04:29:59+00:00\",\"author\":{\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/#\\\/schema\\\/person\\\/63a68934672db675ff0cd80d066510c2\"},\"description\":\"Given an array of integers which are unsorted, you need to find the largest sub-array made up of consecutive integers. The elements must be unique\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/question-5-find-largest-sub-array\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/question-5-find-largest-sub-array\\\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/question-5-find-largest-sub-array\\\/#primaryimage\",\"url\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/wp-content\\\/uploads\\\/sites\\\/4\\\/2019\\\/02\\\/Largest-Sub-array.jpg\",\"contentUrl\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/wp-content\\\/uploads\\\/sites\\\/4\\\/2019\\\/02\\\/Largest-Sub-array.jpg\",\"width\":927,\"height\":496,\"caption\":\"Find the largest sub-array\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/question-5-find-largest-sub-array\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Question 5 – Find Largest Sub-array\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/#website\",\"url\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/\",\"name\":\"Coding Challenge\",\"description\":\"\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/#\\\/schema\\\/person\\\/63a68934672db675ff0cd80d066510c2\",\"name\":\"kindsonthegenius\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/3079a7f663b02e801d03cd075852a037af36bd179b5fbcd0603bae3dd7833a9b?s=96&d=mm&r=g\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/3079a7f663b02e801d03cd075852a037af36bd179b5fbcd0603bae3dd7833a9b?s=96&d=mm&r=g\",\"contentUrl\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/3079a7f663b02e801d03cd075852a037af36bd179b5fbcd0603bae3dd7833a9b?s=96&d=mm&r=g\",\"caption\":\"kindsonthegenius\"},\"url\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/author\\\/kindsonthegenius-2\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Question 5 - Find Largest Sub-array - Coding Challenge","description":"Given an array of integers which are unsorted, you need to find the largest sub-array made up of consecutive integers. The elements must be unique","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:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/","og_locale":"en_US","og_type":"article","og_title":"Question 5 - Find Largest Sub-array - Coding Challenge","og_description":"Given an array of integers which are unsorted, you need to find the largest sub-array made up of consecutive integers. The elements must be unique","og_url":"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/","og_site_name":"Coding Challenge","article_published_time":"2019-02-06T04:29:59+00:00","og_image":[{"width":927,"height":496,"url":"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Largest-Sub-array.jpg","type":"image\/jpeg"}],"author":"kindsonthegenius","twitter_card":"summary_large_image","twitter_misc":{"Written by":"kindsonthegenius","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/#article","isPartOf":{"@id":"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/"},"author":{"name":"kindsonthegenius","@id":"https:\/\/www.kindsonthegenius.com\/coding\/#\/schema\/person\/63a68934672db675ff0cd80d066510c2"},"headline":"Question 5 – Find Largest Sub-array","datePublished":"2019-02-06T04:29:59+00:00","mainEntityOfPage":{"@id":"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/"},"wordCount":129,"commentCount":0,"image":{"@id":"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/#primaryimage"},"thumbnailUrl":"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Largest-Sub-array.jpg","keywords":["Largest Sub-array"],"articleSection":["Array","Coding Challenge","Java"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/","url":"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/","name":"Question 5 - Find Largest Sub-array - Coding Challenge","isPartOf":{"@id":"https:\/\/www.kindsonthegenius.com\/coding\/#website"},"primaryImageOfPage":{"@id":"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/#primaryimage"},"image":{"@id":"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/#primaryimage"},"thumbnailUrl":"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Largest-Sub-array.jpg","datePublished":"2019-02-06T04:29:59+00:00","author":{"@id":"https:\/\/www.kindsonthegenius.com\/coding\/#\/schema\/person\/63a68934672db675ff0cd80d066510c2"},"description":"Given an array of integers which are unsorted, you need to find the largest sub-array made up of consecutive integers. The elements must be unique","breadcrumb":{"@id":"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/#primaryimage","url":"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Largest-Sub-array.jpg","contentUrl":"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Largest-Sub-array.jpg","width":927,"height":496,"caption":"Find the largest sub-array"},{"@type":"BreadcrumbList","@id":"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.kindsonthegenius.com\/coding\/"},{"@type":"ListItem","position":2,"name":"Question 5 – Find Largest Sub-array"}]},{"@type":"WebSite","@id":"https:\/\/www.kindsonthegenius.com\/coding\/#website","url":"https:\/\/www.kindsonthegenius.com\/coding\/","name":"Coding Challenge","description":"","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.kindsonthegenius.com\/coding\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/www.kindsonthegenius.com\/coding\/#\/schema\/person\/63a68934672db675ff0cd80d066510c2","name":"kindsonthegenius","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/3079a7f663b02e801d03cd075852a037af36bd179b5fbcd0603bae3dd7833a9b?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/3079a7f663b02e801d03cd075852a037af36bd179b5fbcd0603bae3dd7833a9b?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/3079a7f663b02e801d03cd075852a037af36bd179b5fbcd0603bae3dd7833a9b?s=96&d=mm&r=g","caption":"kindsonthegenius"},"url":"https:\/\/www.kindsonthegenius.com\/coding\/author\/kindsonthegenius-2\/"}]}},"_links":{"self":[{"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/posts\/41","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/users\/395"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/comments?post=41"}],"version-history":[{"count":1,"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/posts\/41\/revisions"}],"predecessor-version":[{"id":43,"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/posts\/41\/revisions\/43"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/media\/42"}],"wp:attachment":[{"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/media?parent=41"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/categories?post=41"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/tags?post=41"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}