{"id":11652,"date":"2022-09-28T04:26:27","date_gmt":"2022-09-27T22:56:27","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/"},"modified":"2022-09-28T04:26:27","modified_gmt":"2022-09-27T22:56:27","slug":"solved-determine-whether-array-holds-an-almost-increasing-sequence","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/","title":{"rendered":"[Solved] Determine whether array holds an almost increasing sequence"},"content":{"rendered":"<p> [ad_1]<br \/>\n<\/p>\n<div id=\"answer-47168233\" class=\"answer js-answer accepted-answer js-accepted-answer\" data-answerid=\"47168233\" data-parentid=\"47168005\" data-score=\"5\" data-position-on-page=\"1\" data-highest-scored=\"1\" data-question-has-accepted-highest-score=\"1\" itemprop=\"acceptedAnswer\" itemscope itemtype=\"https:\/\/schema.org\/Answer\">\n<div class=\"post-layout\">\n<div class=\"votecell post-layout--left\"><\/div>\n<div class=\"answercell post-layout--right\">\n<div class=\"s-prose js-post-body\" itemprop=\"text\">\n<p>There is no need to use a nested loop, nor to create new arrays. This can be done in <em>O(n)<\/em> time:<\/p>\n<\/p>\n<div class=\"snippet\" data-lang=\"js\" data-hide=\"false\" data-console=\"true\" data-babel=\"false\">\n<div class=\"snippet-code\">\n<pre class=\"snippet-code-js lang-js prettyprint-override\"><code>function almostIncreasingSequence(sequence) {\r\n    var prev = -Infinity,\r\n        beforePrev = -Infinity,\r\n        allowExceptions = true;\r\n    \r\n    for (var curr of sequence) {\r\n        \/\/ Is order not maintained?\r\n        if (curr &lt;= prev) {\r\n            \/\/ Give up when this is not the first exception\r\n            if (!allowExceptions) return false;\r\n            allowExceptions = false;\r\n            \/\/ Decide whether to skip the current or previous value\r\n            if (curr &gt; beforePrev) prev = curr;\r\n        } else { \/\/ Normal case: keep track of two preceding values\r\n            beforePrev = prev;\r\n            prev = curr;\r\n        }\r\n    }\r\n    return true;\r\n}\r\n\r\nconsole.log(almostIncreasingSequence([1,5,3,4,8])); \/\/ true\r\nconsole.log(almostIncreasingSequence([1,5,0,6,8])); \/\/ true\r\nconsole.log(almostIncreasingSequence([1,5,0,4,8])); \/\/ false<\/code><\/pre>\n<\/div>\n<\/div><\/div>\n<div class=\"mt24\"><\/div>\n<\/div>\n<p>            <span class=\"d-none\" itemprop=\"commentCount\">1<\/span> <\/p><\/div>\n<\/div>\n<p>[ad_2]<\/p>\n<p>solved Determine whether array holds an almost increasing sequence <\/p>\n","protected":false},"excerpt":{"rendered":"<p>[ad_1] There is no need to use a nested loop, nor to create new arrays. This can be done in O(n) time: function almostIncreasingSequence(sequence) { var prev = -Infinity, beforePrev = -Infinity, allowExceptions = true; for (var curr of sequence) { \/\/ Is order not maintained? if (curr &lt;= prev) { \/\/ Give up when &#8230; <a title=\"[Solved] Determine whether array holds an almost increasing sequence\" class=\"read-more\" href=\"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/\" aria-label=\"More on [Solved] Determine whether array holds an almost increasing sequence\">Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[320],"tags":[333],"class_list":["post-11652","post","type-post","status-publish","format-standard","hentry","category-solved","tag-javascript"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.5 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>[Solved] Determine whether array holds an almost increasing sequence - JassWeb<\/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:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] Determine whether array holds an almost increasing sequence - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] There is no need to use a nested loop, nor to create new arrays. This can be done in O(n) time: function almostIncreasingSequence(sequence) { var prev = -Infinity, beforePrev = -Infinity, allowExceptions = true; for (var curr of sequence) { \/\/ Is order not maintained? if (curr &lt;= prev) { \/\/ Give up when ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2022-09-27T22:56:27+00:00\" \/>\n<meta name=\"author\" content=\"Kirat\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Kirat\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] Determine whether array holds an almost increasing sequence\",\"datePublished\":\"2022-09-27T22:56:27+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/\"},\"wordCount\":42,\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"keywords\":[\"javascript\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/\",\"url\":\"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/\",\"name\":\"[Solved] Determine whether array holds an almost increasing sequence - JassWeb\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#website\"},\"datePublished\":\"2022-09-27T22:56:27+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/jassweb.com\/solved\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] Determine whether array holds an almost increasing sequence\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/jassweb.com\/solved\/#website\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"name\":\"JassWeb\",\"description\":\"Build High-quality Websites\",\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/jassweb.com\/solved\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\",\"name\":\"Jass Web\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"contentUrl\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"width\":693,\"height\":132,\"caption\":\"Jass Web\"},\"image\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\",\"name\":\"Kirat\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775193939\",\"contentUrl\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775193939\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\/\/jassweb.com\"],\"url\":\"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] Determine whether array holds an almost increasing sequence - JassWeb","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:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] Determine whether array holds an almost increasing sequence - JassWeb","og_description":"[ad_1] There is no need to use a nested loop, nor to create new arrays. This can be done in O(n) time: function almostIncreasingSequence(sequence) { var prev = -Infinity, beforePrev = -Infinity, allowExceptions = true; for (var curr of sequence) { \/\/ Is order not maintained? if (curr &lt;= prev) { \/\/ Give up when ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/","og_site_name":"JassWeb","article_published_time":"2022-09-27T22:56:27+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] Determine whether array holds an almost increasing sequence","datePublished":"2022-09-27T22:56:27+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/"},"wordCount":42,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["javascript"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/","url":"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/","name":"[Solved] Determine whether array holds an almost increasing sequence - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2022-09-27T22:56:27+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-determine-whether-array-holds-an-almost-increasing-sequence\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] Determine whether array holds an almost increasing sequence"}]},{"@type":"WebSite","@id":"https:\/\/jassweb.com\/solved\/#website","url":"https:\/\/jassweb.com\/solved\/","name":"JassWeb","description":"Build High-quality Websites","publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jassweb.com\/solved\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/jassweb.com\/solved\/#organization","name":"Jass Web","url":"https:\/\/jassweb.com\/solved\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/","url":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","contentUrl":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","width":693,"height":132,"caption":"Jass Web"},"image":{"@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31","name":"Kirat","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/","url":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775193939","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775193939","caption":"Kirat"},"sameAs":["http:\/\/jassweb.com"],"url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/"}]}},"_links":{"self":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/11652","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/comments?post=11652"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/11652\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=11652"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=11652"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=11652"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}