{"id":171,"date":"2020-08-23T07:31:06","date_gmt":"2020-08-23T07:31:06","guid":{"rendered":"https:\/\/www.kindsonthegenius.com\/coding\/?page_id=171"},"modified":"2020-08-23T07:31:06","modified_gmt":"2020-08-23T07:31:06","slug":"browse-all","status":"publish","type":"page","link":"https:\/\/www.kindsonthegenius.com\/coding\/","title":{"rendered":"Browse All"},"content":{"rendered":"<div class=\"pt-cv-wrapper\"><div class=\"pt-cv-view pt-cv-grid pt-cv-colsys\" id=\"pt-cv-view-a2b32e3o0z\"><div data-id=\"pt-cv-page-1\" class=\"pt-cv-page\" data-cvc=\"1\"><div class=\"col-md-12 col-sm-12 col-xs-12 pt-cv-content-item pt-cv-2-col\" ><div class='pt-cv-ifield'><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-1-find-pair-with-given-sum-in-an-array\/\" class=\"_self pt-cv-href-thumbnail pt-cv-thumb-left\" target=\"_self\" ><img loading=\"lazy\" decoding=\"async\" width=\"300\" height=\"160\" src=\"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Pair-with-given-sum-300x160.jpg\" class=\"pt-cv-thumbnail pull-left\" alt=\"Pair with a given sume\" srcset=\"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Pair-with-given-sum-300x160.jpg 300w, https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Pair-with-given-sum-768x410.jpg 768w, https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Pair-with-given-sum.jpg 927w\" sizes=\"auto, (max-width: 300px) 100vw, 300px\" \/><\/a>\n<div class=\"pt-cv-colwrap\"><h4 class=\"pt-cv-title\"><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-1-find-pair-with-given-sum-in-an-array\/\" class=\"_self\" target=\"_self\" >Question 1: Find Pair With Given Sum in an Array<\/a><\/h4><div class=\"pt-cv-content\">Question 1 Given an array of integers, you must find a pair within the array that sums up to a ...<br \/><div class=\"pt-cv-rmwrap\"><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-1-find-pair-with-given-sum-in-an-array\/\" class=\"_self pt-cv-readmore btn btn-success\" target=\"_self\">Read More<\/a><\/div><\/div><\/div><\/div><\/div>\n<div class=\"col-md-12 col-sm-12 col-xs-12 pt-cv-content-item pt-cv-2-col\" ><div class='pt-cv-ifield'><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-2-check-if-subarray-with-zero-sum-exists\/\" class=\"_self pt-cv-href-thumbnail pt-cv-thumb-left\" target=\"_self\" ><img loading=\"lazy\" decoding=\"async\" width=\"300\" height=\"160\" src=\"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Subarray-with-zero-sum-300x160.jpg\" class=\"pt-cv-thumbnail pull-left\" alt=\"Check for subarray with zero sum\" srcset=\"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Subarray-with-zero-sum-300x160.jpg 300w, https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Subarray-with-zero-sum-768x410.jpg 768w, https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Subarray-with-zero-sum.jpg 927w\" sizes=\"auto, (max-width: 300px) 100vw, 300px\" \/><\/a>\n<div class=\"pt-cv-colwrap\"><h4 class=\"pt-cv-title\"><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-2-check-if-subarray-with-zero-sum-exists\/\" class=\"_self\" target=\"_self\" >Question 2: Check if Subarray with Zero Sum Exists<\/a><\/h4><div class=\"pt-cv-content\">Question 2 You are given an integer array. You need to check if the array contains sub-array with zero sum ...<br \/><div class=\"pt-cv-rmwrap\"><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-2-check-if-subarray-with-zero-sum-exists\/\" class=\"_self pt-cv-readmore btn btn-success\" target=\"_self\">Read More<\/a><\/div><\/div><\/div><\/div><\/div>\n<div class=\"col-md-12 col-sm-12 col-xs-12 pt-cv-content-item pt-cv-2-col\" ><div class='pt-cv-ifield'><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-3-sort-a-binary-array-in-linear-time\/\" class=\"_self pt-cv-href-thumbnail pt-cv-thumb-left\" target=\"_self\" ><img loading=\"lazy\" decoding=\"async\" width=\"300\" height=\"162\" src=\"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Sort-a-Binary-Array-Python-300x162.jpg\" class=\"pt-cv-thumbnail pull-left\" alt=\"Sort a Binary array\" srcset=\"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Sort-a-Binary-Array-Python-300x162.jpg 300w, https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Sort-a-Binary-Array-Python-768x416.jpg 768w, https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Sort-a-Binary-Array-Python.jpg 1005w\" sizes=\"auto, (max-width: 300px) 100vw, 300px\" \/><\/a>\n<div class=\"pt-cv-colwrap\"><h4 class=\"pt-cv-title\"><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-3-sort-a-binary-array-in-linear-time\/\" class=\"_self\" target=\"_self\" >Question 3 &#8211; Sort a Binary Array in Linear Time<\/a><\/h4><div class=\"pt-cv-content\">Question 3 Given an unsorted binary array, you need to sort it in linear time - O(n) and constant space ...<br \/><div class=\"pt-cv-rmwrap\"><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-3-sort-a-binary-array-in-linear-time\/\" class=\"_self pt-cv-readmore btn btn-success\" target=\"_self\">Read More<\/a><\/div><\/div><\/div><\/div><\/div>\n<div class=\"col-md-12 col-sm-12 col-xs-12 pt-cv-content-item pt-cv-2-col\" ><div class='pt-cv-ifield'><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-4-find-duplicate-element-in-array\/\" class=\"_self pt-cv-href-thumbnail pt-cv-thumb-left\" target=\"_self\" ><img loading=\"lazy\" decoding=\"async\" width=\"300\" height=\"160\" src=\"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Find-Duplicate-Element-in-an-Array-300x160.jpg\" class=\"pt-cv-thumbnail pull-left\" alt=\"Find duplicate element in an array\" srcset=\"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Find-Duplicate-Element-in-an-Array-300x160.jpg 300w, https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Find-Duplicate-Element-in-an-Array-768x410.jpg 768w, https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Find-Duplicate-Element-in-an-Array.jpg 927w\" sizes=\"auto, (max-width: 300px) 100vw, 300px\" \/><\/a>\n<div class=\"pt-cv-colwrap\"><h4 class=\"pt-cv-title\"><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-4-find-duplicate-element-in-array\/\" class=\"_self\" target=\"_self\" >Question 4: Find Duplicate Element in Array<\/a><\/h4><div class=\"pt-cv-content\">Question 4 You are given an array of size n. One of the elements of the array appears twice in ...<br \/><div class=\"pt-cv-rmwrap\"><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-4-find-duplicate-element-in-array\/\" class=\"_self pt-cv-readmore btn btn-success\" target=\"_self\">Read More<\/a><\/div><\/div><\/div><\/div><\/div>\n<div class=\"col-md-12 col-sm-12 col-xs-12 pt-cv-content-item pt-cv-2-col\" ><div class='pt-cv-ifield'><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/\" class=\"_self pt-cv-href-thumbnail pt-cv-thumb-left\" target=\"_self\" ><img loading=\"lazy\" decoding=\"async\" width=\"300\" height=\"161\" src=\"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Largest-Sub-array-300x161.jpg\" class=\"pt-cv-thumbnail pull-left\" alt=\"Find the largest sub-array\" srcset=\"https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Largest-Sub-array-300x161.jpg 300w, https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Largest-Sub-array-768x411.jpg 768w, https:\/\/www.kindsonthegenius.com\/coding\/wp-content\/uploads\/sites\/4\/2019\/02\/Largest-Sub-array.jpg 927w\" sizes=\"auto, (max-width: 300px) 100vw, 300px\" \/><\/a>\n<div class=\"pt-cv-colwrap\"><h4 class=\"pt-cv-title\"><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/\" class=\"_self\" target=\"_self\" >Question 5 &#8211; Find Largest Sub-array<\/a><\/h4><div class=\"pt-cv-content\">Question 5 You are given an unsorted array of integers. You\u00a0 need to find the largest sub-array formed by consecutive ...<br \/><div class=\"pt-cv-rmwrap\"><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/question-5-find-largest-sub-array\/\" class=\"_self pt-cv-readmore btn btn-success\" target=\"_self\">Read More<\/a><\/div><\/div><\/div><\/div><\/div>\n<div class=\"col-md-12 col-sm-12 col-xs-12 pt-cv-content-item pt-cv-2-col\" ><div class='pt-cv-ifield'><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/binary-search-tree\/\" class=\"_self pt-cv-href-thumbnail pt-cv-thumb-left\" target=\"_self\" ><\/a>\n<div class=\"pt-cv-colwrap\"><h4 class=\"pt-cv-title\"><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/binary-search-tree\/\" class=\"_self\" target=\"_self\" >Binary Search Tree<\/a><\/h4><div class=\"pt-cv-content\">We would cover the Binary Search Tree implementation in Java under the following: Introduction to Binary Search Tree Java Program ...<br \/><div class=\"pt-cv-rmwrap\"><a href=\"https:\/\/www.kindsonthegenius.com\/coding\/binary-search-tree\/\" class=\"_self pt-cv-readmore btn btn-success\" target=\"_self\">Read More<\/a><\/div><\/div><\/div><\/div><\/div><\/div><\/div><\/div>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":395,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-171","page","type-page","status-publish","hentry"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.6 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Browse All - Coding Challenge<\/title>\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\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Browse All - Coding Challenge\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.kindsonthegenius.com\/coding\/\" \/>\n<meta property=\"og:site_name\" content=\"Coding Challenge\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/\",\"url\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/\",\"name\":\"Browse All - Coding Challenge\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/#website\"},\"datePublished\":\"2020-08-23T07:31:06+00:00\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/www.kindsonthegenius.com\\\/coding\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Browse All\"}]},{\"@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\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Browse All - Coding Challenge","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\/","og_locale":"en_US","og_type":"article","og_title":"Browse All - Coding Challenge","og_url":"https:\/\/www.kindsonthegenius.com\/coding\/","og_site_name":"Coding Challenge","twitter_card":"summary_large_image","schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.kindsonthegenius.com\/coding\/","url":"https:\/\/www.kindsonthegenius.com\/coding\/","name":"Browse All - Coding Challenge","isPartOf":{"@id":"https:\/\/www.kindsonthegenius.com\/coding\/#website"},"datePublished":"2020-08-23T07:31:06+00:00","breadcrumb":{"@id":"https:\/\/www.kindsonthegenius.com\/coding\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.kindsonthegenius.com\/coding\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.kindsonthegenius.com\/coding\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.kindsonthegenius.com\/coding\/"},{"@type":"ListItem","position":2,"name":"Browse All"}]},{"@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"}]}},"_links":{"self":[{"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/pages\/171","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/types\/page"}],"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=171"}],"version-history":[{"count":1,"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/pages\/171\/revisions"}],"predecessor-version":[{"id":172,"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/pages\/171\/revisions\/172"}],"wp:attachment":[{"href":"https:\/\/www.kindsonthegenius.com\/coding\/wp-json\/wp\/v2\/media?parent=171"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}