{"id":8513,"date":"2025-01-03T15:30:11","date_gmt":"2025-01-03T12:30:11","guid":{"rendered":"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/"},"modified":"2025-01-03T15:30:11","modified_gmt":"2025-01-03T12:30:11","slug":"leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu","status":"publish","type":"post","link":"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/","title":{"rendered":"LeetCode 209: Minimum Boyuttaki Alt Dizi Toplam\u0131 &#8211; JavaScript \u00c7\u00f6z\u00fcm\u00fc"},"content":{"rendered":"<p><body><\/p>\n<p>LeetCode 209: Minimum Boyuttaki Alt Dizi Toplam\u0131 &#8211; JavaScript \u00c7\u00f6z\u00fcm\u00fc<\/p>\n<p>LeetCode&#8217;da s\u0131k\u00e7a kar\u015f\u0131la\u015ft\u0131\u011f\u0131m\u0131z zorlu problemlerden biri olan &#8220;Minimum Boyuttaki Alt Dizi Toplam\u0131&#8221; (Minimum Size Subarray Sum) problemini ele alaca\u011f\u0131z.  Bu problemde, verilen bir say\u0131 dizisinde, toplam\u0131 belirli bir hedef de\u011feri (target) a\u015fan veya ona e\u015fit olan en k\u00fc\u00e7\u00fck alt dizinin uzunlu\u011funu bulmam\u0131z gerekiyor.  \u00d6rne\u011fin, dizi <code>[2,3,1,2,4,3]<\/code> ve hedef de\u011fer 7 ise, en k\u00fc\u00e7\u00fck alt dizi <code>[4,3]<\/code> olur ve uzunlu\u011fu 2&#8217;dir.<\/p>\n<p>Bu problemi \u00e7\u00f6zmek i\u00e7in birka\u00e7 farkl\u0131 yakla\u015f\u0131m kullan\u0131labilir.  Ancak en verimli \u00e7\u00f6z\u00fcmler genellikle &#8220;Kayan Pencere&#8221; (Sliding Window) algoritmas\u0131n\u0131 kullan\u0131r.  Bu y\u00f6ntem, iki i\u015faret\u00e7i (ba\u015flang\u0131\u00e7 ve biti\u015f) ile dizide gezinerek, alt dizinin toplam\u0131n\u0131 s\u00fcrekli olarak g\u00fcnceller.  Toplam hedef de\u011fere ula\u015ft\u0131\u011f\u0131nda veya a\u015ft\u0131\u011f\u0131nda, alt dizinin uzunlu\u011funu hesaplar ve minimum uzunlu\u011fu g\u00fcnceller. Daha sonra, ba\u015flang\u0131\u00e7 i\u015faret\u00e7isini hareket ettirerek, alt dizinin boyutunu k\u00fc\u00e7\u00fcltmeye \u00e7al\u0131\u015f\u0131r ve i\u015flemi tekrarlar.<\/p>\n<h2>Kayan Pencere Algoritmas\u0131 ile \u00c7\u00f6z\u00fcm<\/h2>\n<p>\u0130\u015fte JavaScript kullan\u0131larak Kayan Pencere algoritmas\u0131 ile yaz\u0131lm\u0131\u015f bir \u00e7\u00f6z\u00fcm:<\/p>\n<pre><code class=\"language-javascript\">\n\/**\n * @param {number} target\n * @param {number[]} nums\n * @return {number}\n *\/\nvar minSubArrayLen = function(target, nums) {\n    let minLen = Infinity;\n    let windowStart = 0;\n    let windowSum = 0;\n\n    for (let windowEnd = 0; windowEnd < nums.length; windowEnd++) {\n        windowSum += nums[windowEnd];\n\n        while (windowSum >= target) {\n            minLen = Math.min(minLen, windowEnd - windowStart + 1);\n            windowSum -= nums[windowStart];\n            windowStart++;\n        }\n    }\n\n    return minLen === Infinity ? 0 : minLen;\n};\n<\/code><\/pre>\n<p>Bu kodda, <code>windowStart<\/code> ve <code>windowEnd<\/code> i\u015faret\u00e7ileri ile kayan pencere olu\u015fturulur.  <code>windowSum<\/code> de\u011fi\u015fkeni, pencerenin i\u00e7indeki say\u0131lar\u0131n toplam\u0131n\u0131 tutar.  D\u00f6ng\u00fc, pencere i\u00e7indeki toplam\u0131n hedef de\u011feri a\u015fana kadar devam eder.  Hedef de\u011fere ula\u015f\u0131ld\u0131\u011f\u0131nda veya ge\u00e7ildi\u011finde, minimum uzunluk g\u00fcncellenir ve ba\u015flang\u0131\u00e7 i\u015faret\u00e7isi hareket ettirilerek pencere k\u00fc\u00e7\u00fclt\u00fcl\u00fcr.<\/p>\n<h2>Performans Analizi<\/h2>\n<p>Kayan Pencere algoritmas\u0131n\u0131n zaman karma\u015f\u0131kl\u0131\u011f\u0131 O(n) iken,  brute-force yakla\u015f\u0131mlar\u0131n zaman karma\u015f\u0131kl\u0131\u011f\u0131 O(n^2) olur. Bu, \u00f6zellikle b\u00fcy\u00fck girdiler i\u00e7in Kayan Pencere algoritmas\u0131n\u0131n \u00e7ok daha verimli oldu\u011funu g\u00f6sterir.  Bellek karma\u015f\u0131kl\u0131\u011f\u0131 ise O(1)&#8217;dir, yani kullan\u0131lan bellek miktar\u0131 girdi boyutundan ba\u011f\u0131ms\u0131zd\u0131r.<\/p>\n<p>Bu problem,  algoritma ve veri yap\u0131lar\u0131 bilginizi geli\u015ftirmek i\u00e7in harika bir pratik \u00f6rne\u011fidir.  Daha fazla algoritma ve \u00e7\u00f6z\u00fcm i\u00e7in <a href=\"https:\/\/fatihsoysal.com\">fatihsoysal.com<\/a> sitesini ziyaret edebilirsiniz.<\/p>\n<p>Di\u011fer \u00e7\u00f6z\u00fcm yakla\u015f\u0131mlar\u0131 ve daha detayl\u0131 analizler i\u00e7in <a href=\"https:\/\/dev.to\/rahulgithubweb\/leetcode-challenge-209-minimum-size-subarray-sum-javascript-solution-40n0\">buraya<\/a> bakabilirsiniz.<\/p>\n<p>#Etiketler<br \/>\nleetcode, javascript, algoritma, programlama, minimum alt dizi toplam\u0131, sliding window, iki i\u015faret\u00e7i, fatihsoysal, kayan pencere,  performans analizi,  javascript \u00e7\u00f6z\u00fcm\u00fc<\/p>\n<p><\/body><br \/>\n<\/html><\/p>\n","protected":false},"excerpt":{"rendered":"LeetCode 209: Minimum Boyuttaki Alt Dizi Toplam\u0131 &#8211; JavaScript \u00c7\u00f6z\u00fcm\u00fc LeetCode&#8217;da s\u0131k\u00e7a kar\u015f\u0131la\u015ft\u0131\u011f\u0131m\u0131z zorlu problemlerden biri olan &#8220;Minimum&hellip;","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"csco_page_header_type":"","csco_page_load_nextpost":"","csco_page_subscribe_form":"","csco_page_contact_form":"","footnotes":""},"categories":[1],"tags":[],"class_list":{"0":"post-8513","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-genel","7":"cs-entry","8":"cs-video-wrap"},"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v20.5 (Yoast SEO v25.3.1) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>LeetCode 209: Minimum Boyuttaki Alt Dizi Toplam\u0131 - JavaScript \u00c7\u00f6z\u00fcm\u00fc<\/title>\n<meta name=\"description\" content=\"LeetCode&#039;da s\u0131k\u00e7a kar\u015f\u0131la\u015ft\u0131\u011f\u0131m\u0131z zorlu problemlerden biri olan &quot;Minimum Boyuttaki Alt Dizi Toplam\u0131&quot; (Minimum Size Subarray Sum) problemini ele alaca\u011f\u0131z. Bu problemde, verilen bir say\u0131 dizisinde, toplam\u0131 belirli bir hedef de\u011feri (target) a\u015fan veya ona e\u015fit olan en k\u00fc\u00e7\u00fck alt dizinin uzunlu\u011funu bulmam\u0131z gerekiyor. \u00d6rne\u011fin, dizi [2,3,1,2,4,3] ve hedef de\u011fer 7 ise, en k\u00fc\u00e7\u00fck alt dizi [4,3] olur ve uzunlu\u011fu 2&#039;dir.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"LeetCode 209: Minimum Boyuttaki Alt Dizi Toplam\u0131 - JavaScript \u00c7\u00f6z\u00fcm\u00fc\" \/>\n<meta property=\"og:description\" content=\"LeetCode&#039;da s\u0131k\u00e7a kar\u015f\u0131la\u015ft\u0131\u011f\u0131m\u0131z zorlu problemlerden biri olan &quot;Minimum Boyuttaki Alt Dizi Toplam\u0131&quot; (Minimum Size Subarray Sum) problemini ele alaca\u011f\u0131z. Bu problemde, verilen bir say\u0131 dizisinde, toplam\u0131 belirli bir hedef de\u011feri (target) a\u015fan veya ona e\u015fit olan en k\u00fc\u00e7\u00fck alt dizinin uzunlu\u011funu bulmam\u0131z gerekiyor. \u00d6rne\u011fin, dizi [2,3,1,2,4,3] ve hedef de\u011fer 7 ise, en k\u00fc\u00e7\u00fck alt dizi [4,3] olur ve uzunlu\u011fu 2&#039;dir.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/\" \/>\n<meta property=\"og:site_name\" content=\"Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2025-01-03T12:30:11+00:00\" \/>\n<meta name=\"author\" content=\"Fatih Soysal\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Yazan:\" \/>\n\t<meta name=\"twitter:data1\" content=\"Fatih Soysal\" \/>\n\t<meta name=\"twitter:label2\" content=\"Tahmini okuma s\u00fcresi\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 dakika\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/\"},\"author\":{\"name\":\"Fatih Soysal\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"headline\":\"LeetCode 209: Minimum Boyuttaki Alt Dizi Toplam\u0131 &#8211; JavaScript \u00c7\u00f6z\u00fcm\u00fc\",\"datePublished\":\"2025-01-03T12:30:11+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/\"},\"wordCount\":396,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/#respond\"]}],\"copyrightYear\":\"2025\",\"copyrightHolder\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/\",\"name\":\"LeetCode 209: Minimum Boyuttaki Alt Dizi Toplam\u0131 - JavaScript \u00c7\u00f6z\u00fcm\u00fc\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\"},\"datePublished\":\"2025-01-03T12:30:11+00:00\",\"description\":\"LeetCode'da s\u0131k\u00e7a kar\u015f\u0131la\u015ft\u0131\u011f\u0131m\u0131z zorlu problemlerden biri olan \\\"Minimum Boyuttaki Alt Dizi Toplam\u0131\\\" (Minimum Size Subarray Sum) problemini ele alaca\u011f\u0131z. Bu problemde, verilen bir say\u0131 dizisinde, toplam\u0131 belirli bir hedef de\u011feri (target) a\u015fan veya ona e\u015fit olan en k\u00fc\u00e7\u00fck alt dizinin uzunlu\u011funu bulmam\u0131z gerekiyor. \u00d6rne\u011fin, dizi [2,3,1,2,4,3] ve hedef de\u011fer 7 ise, en k\u00fc\u00e7\u00fck alt dizi [4,3] olur ve uzunlu\u011fu 2'dir.\",\"breadcrumb\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Anasayfa\",\"item\":\"https:\/\/fatihsoysal.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"LeetCode 209: Minimum Boyuttaki Alt Dizi Toplam\u0131 &#8211; JavaScript \u00c7\u00f6z\u00fcm\u00fc\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/\",\"name\":\"Fatihsoysal.com\",\"description\":\"Blog - Yaz\u0131l\u0131m D\u00fcnyas\u0131 Tecr\u00fcbelerim\",\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/fatihsoysal.com\/blog\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"tr\"},{\"@type\":[\"Person\",\"Organization\"],\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\",\"name\":\"Fatih Soysal\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"tr\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png\",\"contentUrl\":\"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png\",\"width\":512,\"height\":512,\"caption\":\"Fatih Soysal\"},\"logo\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/\"},\"description\":\"Kullan\u0131m ve kodlama m\u00fckemmeliyetini odak alan uygulamalar olu\u015fturma deneyimine sahip, profesyonel olarak 15+ y\u0131l \u00fczeri deneyime sahip bir yaz\u0131l\u0131m m\u00fchendisi.\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/author\/fatihsoysal\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"LeetCode 209: Minimum Boyuttaki Alt Dizi Toplam\u0131 - JavaScript \u00c7\u00f6z\u00fcm\u00fc","description":"LeetCode'da s\u0131k\u00e7a kar\u015f\u0131la\u015ft\u0131\u011f\u0131m\u0131z zorlu problemlerden biri olan \"Minimum Boyuttaki Alt Dizi Toplam\u0131\" (Minimum Size Subarray Sum) problemini ele alaca\u011f\u0131z. Bu problemde, verilen bir say\u0131 dizisinde, toplam\u0131 belirli bir hedef de\u011feri (target) a\u015fan veya ona e\u015fit olan en k\u00fc\u00e7\u00fck alt dizinin uzunlu\u011funu bulmam\u0131z gerekiyor. \u00d6rne\u011fin, dizi [2,3,1,2,4,3] ve hedef de\u011fer 7 ise, en k\u00fc\u00e7\u00fck alt dizi [4,3] olur ve uzunlu\u011fu 2'dir.","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:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/","og_locale":"tr_TR","og_type":"article","og_title":"LeetCode 209: Minimum Boyuttaki Alt Dizi Toplam\u0131 - JavaScript \u00c7\u00f6z\u00fcm\u00fc","og_description":"LeetCode'da s\u0131k\u00e7a kar\u015f\u0131la\u015ft\u0131\u011f\u0131m\u0131z zorlu problemlerden biri olan \"Minimum Boyuttaki Alt Dizi Toplam\u0131\" (Minimum Size Subarray Sum) problemini ele alaca\u011f\u0131z. Bu problemde, verilen bir say\u0131 dizisinde, toplam\u0131 belirli bir hedef de\u011feri (target) a\u015fan veya ona e\u015fit olan en k\u00fc\u00e7\u00fck alt dizinin uzunlu\u011funu bulmam\u0131z gerekiyor. \u00d6rne\u011fin, dizi [2,3,1,2,4,3] ve hedef de\u011fer 7 ise, en k\u00fc\u00e7\u00fck alt dizi [4,3] olur ve uzunlu\u011fu 2'dir.","og_url":"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/","og_site_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","article_published_time":"2025-01-03T12:30:11+00:00","author":"Fatih Soysal","twitter_card":"summary_large_image","twitter_misc":{"Yazan:":"Fatih Soysal","Tahmini okuma s\u00fcresi":"2 dakika"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/#article","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/"},"author":{"name":"Fatih Soysal","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"headline":"LeetCode 209: Minimum Boyuttaki Alt Dizi Toplam\u0131 &#8211; JavaScript \u00c7\u00f6z\u00fcm\u00fc","datePublished":"2025-01-03T12:30:11+00:00","mainEntityOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/"},"wordCount":396,"commentCount":0,"publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/#respond"]}],"copyrightYear":"2025","copyrightHolder":{"@id":"https:\/\/fatihsoysal.com\/blog\/#organization"}},{"@type":"WebPage","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/","url":"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/","name":"LeetCode 209: Minimum Boyuttaki Alt Dizi Toplam\u0131 - JavaScript \u00c7\u00f6z\u00fcm\u00fc","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/#website"},"datePublished":"2025-01-03T12:30:11+00:00","description":"LeetCode'da s\u0131k\u00e7a kar\u015f\u0131la\u015ft\u0131\u011f\u0131m\u0131z zorlu problemlerden biri olan \"Minimum Boyuttaki Alt Dizi Toplam\u0131\" (Minimum Size Subarray Sum) problemini ele alaca\u011f\u0131z. Bu problemde, verilen bir say\u0131 dizisinde, toplam\u0131 belirli bir hedef de\u011feri (target) a\u015fan veya ona e\u015fit olan en k\u00fc\u00e7\u00fck alt dizinin uzunlu\u011funu bulmam\u0131z gerekiyor. \u00d6rne\u011fin, dizi [2,3,1,2,4,3] ve hedef de\u011fer 7 ise, en k\u00fc\u00e7\u00fck alt dizi [4,3] olur ve uzunlu\u011fu 2'dir.","breadcrumb":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-209-minimum-boyuttaki-alt-dizi-toplami-javascript-cozumu\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Anasayfa","item":"https:\/\/fatihsoysal.com\/blog\/"},{"@type":"ListItem","position":2,"name":"LeetCode 209: Minimum Boyuttaki Alt Dizi Toplam\u0131 &#8211; JavaScript \u00c7\u00f6z\u00fcm\u00fc"}]},{"@type":"WebSite","@id":"https:\/\/fatihsoysal.com\/blog\/#website","url":"https:\/\/fatihsoysal.com\/blog\/","name":"Fatihsoysal.com","description":"Blog - Yaz\u0131l\u0131m D\u00fcnyas\u0131 Tecr\u00fcbelerim","publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/fatihsoysal.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"tr"},{"@type":["Person","Organization"],"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1","name":"Fatih Soysal","image":{"@type":"ImageObject","inLanguage":"tr","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/","url":"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png","contentUrl":"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png","width":512,"height":512,"caption":"Fatih Soysal"},"logo":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/"},"description":"Kullan\u0131m ve kodlama m\u00fckemmeliyetini odak alan uygulamalar olu\u015fturma deneyimine sahip, profesyonel olarak 15+ y\u0131l \u00fczeri deneyime sahip bir yaz\u0131l\u0131m m\u00fchendisi.","url":"https:\/\/fatihsoysal.com\/blog\/author\/fatihsoysal\/"}]}},"yoast_meta":{"yoast_wpseo_title":"","yoast_wpseo_metadesc":"","yoast_wpseo_canonical":""},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/8513","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/comments?post=8513"}],"version-history":[{"count":0,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/8513\/revisions"}],"wp:attachment":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/media?parent=8513"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/categories?post=8513"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/tags?post=8513"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}