LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi<\/title><br \/>\n<\/head><br \/>\n<body><\/p>\n<p>LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi<\/p>\n<p>LeetCode’un 3. problemi, “En Uzun Tekrarlanmayan Altdizi” (Longest Substring Without Repeating Characters) problemidir. Bu problem, verilen bir string i\u00e7inde tekrar eden karakter i\u00e7ermeyen en uzun altdizinin uzunlu\u011funu bulmay\u0131 gerektirir. \u00d6rne\u011fin, “abcabcbb” stringi i\u00e7in en uzun tekrarlanmayan altdizi “abc” olup, uzunlu\u011fu 3’t\u00fcr. Bu problemi \u00e7\u00f6zmek i\u00e7in farkl\u0131 yakla\u015f\u0131mlar kullan\u0131labilir; ancak en yayg\u0131n ve etkili y\u00f6ntemlerden biri kayan pencere (sliding window) algoritmas\u0131d\u0131r.<\/p>\n<h2>Kayan Pencere Algoritmas\u0131 ile \u00c7\u00f6z\u00fcm<\/h2>\n<p>Kayan pencere algoritmas\u0131, verilen string \u00fczerinde iki i\u015faret\u00e7i (pointer) kullan\u0131r: ba\u015flang\u0131\u00e7 ve biti\u015f. Ba\u015flang\u0131\u00e7 i\u015faret\u00e7isi altdizinin ba\u015flang\u0131c\u0131n\u0131, biti\u015f i\u015faret\u00e7isi ise sonunu g\u00f6sterir. Algoritma, biti\u015f i\u015faret\u00e7isini sa\u011fa do\u011fru hareket ettirerek stringi tarar. E\u011fer biti\u015f i\u015faret\u00e7isinin g\u00f6sterdi\u011fi karakter, mevcut altdizi i\u00e7inde zaten varsa, ba\u015flang\u0131\u00e7 i\u015faret\u00e7isi, tekrar eden karakteri altdiziden \u00e7\u0131karana kadar sola do\u011fru hareket ettirilir. Bu i\u015flem, her ad\u0131mda en uzun tekrarlanmayan altdizinin uzunlu\u011funu g\u00fcncelleyerek devam eder.<\/p>\n<p>\u00d6rne\u011fin, “abcabcbb” stringi i\u00e7in algoritma \u015fu \u015fekilde \u00e7al\u0131\u015f\u0131r:<\/p>\n<ol>\n<li>Ba\u015flang\u0131\u00e7 ve biti\u015f i\u015faret\u00e7ileri “a” karakterinde ba\u015flar. Altdizi “a”, uzunlu\u011fu 1’dir.<\/li>\n<li>Biti\u015f i\u015faret\u00e7isi “b” ye hareket eder. Altdizi “ab”, uzunlu\u011fu 2’dir.<\/li>\n<li>Biti\u015f i\u015faret\u00e7isi “c” ye hareket eder. Altdizi “abc”, uzunlu\u011fu 3’t\u00fcr.<\/li>\n<li>Biti\u015f i\u015faret\u00e7isi “a” ya hareket eder. “a” zaten altdizi i\u00e7inde var. Ba\u015flang\u0131\u00e7 i\u015faret\u00e7isi “a” y\u0131 altdiziden \u00e7\u0131karmak i\u00e7in “b” ye hareket eder. Yeni altdizi “bca”, uzunlu\u011fu 3’t\u00fcr.<\/li>\n<li>Bu \u015fekilde devam ederek, en uzun tekrarlanmayan altdizi “abc” olarak bulunur ve uzunlu\u011fu 3 olarak kaydedilir.<\/li>\n<\/ol>\n<h2>Kod \u00d6rne\u011fi (Python)<\/h2>\n<pre><code>\ndef longest_substring_without_repeating_characters(s):\n n = len(s)\n ans = 0\n # mp stores the current index of a character\n mp = {}\n\n i = 0\n for j in range(n):\n if s[j] in mp:\n i = max(mp[s[j]], i)\n\n ans = max(ans, j - i + 1)\n mp[s[j]] = j + 1\n\n return ans\n\n# \u00d6rnek kullan\u0131m:\nstring = \"abcabcbb\"\nuzunluk = longest_substring_without_repeating_characters(string)\nprint(f\"'{string}' stringinin en uzun tekrarlanmayan altdizinin uzunlu\u011fu: {uzunluk}\")\n<\/code><\/pre>\n<p>Bu kod \u00f6rne\u011fi, kayan pencere algoritmas\u0131n\u0131 kullanarak problemi etkili bir \u015fekilde \u00e7\u00f6zer. Ancak, daha karma\u015f\u0131k senaryolar i\u00e7in daha optimize \u00e7\u00f6z\u00fcmler gerekebilir. \u00d6rne\u011fin, \u00e7ok b\u00fcy\u00fck stringler i\u00e7in daha verimli veri yap\u0131lar\u0131 kullan\u0131labilir.<\/p>\n<p>Sonu\u00e7 olarak, LeetCode Problem #3, temel algoritma kavramlar\u0131n\u0131 anlamak ve uygulamak i\u00e7in m\u00fckemmel bir \u00f6rnektir. Kayan pencere algoritmas\u0131, bu problem i\u00e7in olduk\u00e7a etkili bir \u00e7\u00f6z\u00fcm sunar ve daha geni\u015f bir yelpazede benzer problemlerin \u00e7\u00f6z\u00fcm\u00fcnde kullan\u0131labilir. Bu problem, veri yap\u0131lar\u0131 ve algoritmalar konusundaki bilgilerinizi geli\u015ftirmenize yard\u0131mc\u0131 olacakt\u0131r. Daha fazla bilgi i\u00e7in <a href=\"https:\/\/dev.to\/sunnat_qayumov\/leetcode-problem03-1bmj\">buraya<\/a> bakabilirsiniz. Kendi algoritma ve veri yap\u0131lar\u0131 \u00e7al\u0131\u015fmalar\u0131n\u0131z i\u00e7in de <a href=\"https:\/\/fatihsoysal.com\">fatihsoysal.com<\/a> sitesini ziyaret edebilirsiniz.<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/via.placeholder.com\/500x300?text=Kayan+Pencere+\u0130ll\u00fcstrasyonu\" alt=\"Kayan Pencere \u0130ll\u00fcstrasyonu\"><\/p>\n<p>#Etiketler: LeetCode, Problem 3, En Uzun Tekrarlanmayan Altdizi, Kayan Pencere Algoritmas\u0131, Sliding Window, Python, Algoritma, Veri Yap\u0131lar\u0131, Programlama, Fatih Soysal<\/p>\n<p><\/body><br \/>\n<\/html><br \/>\n“`<\/p>\n","protected":false},"excerpt":{"rendered":"“`html LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi LeetCode’un 3. problemi,…","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-4301","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-genel","7":"cs-entry","8":"cs-video-wrap"},"yoast_head":"\n<title>LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi<\/title>\n<meta name=\"description\" content=\"LeetCode'un 3. problemi, "En Uzun Tekrarlanmayan Altdizi" (Longest Substring Without Repeating Characters) problemidir. Bu problem, verilen bir string i\u00e7inde tekrar eden karakter i\u00e7ermeyen en uzun altdizinin uzunlu\u011funu bulmay\u0131 gerektirir. \u00d6rne\u011fin, "abcabcbb" stringi i\u00e7in en uzun tekrarlanmayan altdizi "abc" olup, uzunlu\u011fu 3't\u00fcr. Bu problemi \u00e7\u00f6zmek i\u00e7in farkl\u0131 yakla\u015f\u0131mlar kullan\u0131labilir; ancak en yayg\u0131n ve etkili y\u00f6ntemlerden biri kayan pencere (sliding window) algoritmas\u0131d\u0131r.\" \/>\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-problem-3-en-uzun-tekrarlanmayan-altdizi\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi\" \/>\n<meta property=\"og:description\" content=\"LeetCode'un 3. problemi, "En Uzun Tekrarlanmayan Altdizi" (Longest Substring Without Repeating Characters) problemidir. Bu problem, verilen bir string i\u00e7inde tekrar eden karakter i\u00e7ermeyen en uzun altdizinin uzunlu\u011funu bulmay\u0131 gerektirir. \u00d6rne\u011fin, "abcabcbb" stringi i\u00e7in en uzun tekrarlanmayan altdizi "abc" olup, uzunlu\u011fu 3't\u00fcr. Bu problemi \u00e7\u00f6zmek i\u00e7in farkl\u0131 yakla\u015f\u0131mlar kullan\u0131labilir; ancak en yayg\u0131n ve etkili y\u00f6ntemlerden biri kayan pencere (sliding window) algoritmas\u0131d\u0131r.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/\" \/>\n<meta property=\"og:site_name\" content=\"Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2024-11-19T12:30:46+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=\"3 dakika\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/\"},\"author\":{\"name\":\"Fatih Soysal\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"headline\":\"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi\",\"datePublished\":\"2024-11-19T12:30:46+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/\"},\"wordCount\":450,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#respond\"]}],\"copyrightYear\":\"2024\",\"copyrightHolder\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/\",\"name\":\"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\"},\"datePublished\":\"2024-11-19T12:30:46+00:00\",\"description\":\"LeetCode'un 3. problemi, \\\"En Uzun Tekrarlanmayan Altdizi\\\" (Longest Substring Without Repeating Characters) problemidir. Bu problem, verilen bir string i\u00e7inde tekrar eden karakter i\u00e7ermeyen en uzun altdizinin uzunlu\u011funu bulmay\u0131 gerektirir. \u00d6rne\u011fin, \\\"abcabcbb\\\" stringi i\u00e7in en uzun tekrarlanmayan altdizi \\\"abc\\\" olup, uzunlu\u011fu 3't\u00fcr. Bu problemi \u00e7\u00f6zmek i\u00e7in farkl\u0131 yakla\u015f\u0131mlar kullan\u0131labilir; ancak en yayg\u0131n ve etkili y\u00f6ntemlerden biri kayan pencere (sliding window) algoritmas\u0131d\u0131r.\",\"breadcrumb\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Anasayfa\",\"item\":\"https:\/\/fatihsoysal.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi\"}]},{\"@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_head_json":{"title":"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi","description":"LeetCode'un 3. problemi, \"En Uzun Tekrarlanmayan Altdizi\" (Longest Substring Without Repeating Characters) problemidir. Bu problem, verilen bir string i\u00e7inde tekrar eden karakter i\u00e7ermeyen en uzun altdizinin uzunlu\u011funu bulmay\u0131 gerektirir. \u00d6rne\u011fin, \"abcabcbb\" stringi i\u00e7in en uzun tekrarlanmayan altdizi \"abc\" olup, uzunlu\u011fu 3't\u00fcr. Bu problemi \u00e7\u00f6zmek i\u00e7in farkl\u0131 yakla\u015f\u0131mlar kullan\u0131labilir; ancak en yayg\u0131n ve etkili y\u00f6ntemlerden biri kayan pencere (sliding window) algoritmas\u0131d\u0131r.","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-problem-3-en-uzun-tekrarlanmayan-altdizi\/","og_locale":"tr_TR","og_type":"article","og_title":"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi","og_description":"LeetCode'un 3. problemi, \"En Uzun Tekrarlanmayan Altdizi\" (Longest Substring Without Repeating Characters) problemidir. Bu problem, verilen bir string i\u00e7inde tekrar eden karakter i\u00e7ermeyen en uzun altdizinin uzunlu\u011funu bulmay\u0131 gerektirir. \u00d6rne\u011fin, \"abcabcbb\" stringi i\u00e7in en uzun tekrarlanmayan altdizi \"abc\" olup, uzunlu\u011fu 3't\u00fcr. Bu problemi \u00e7\u00f6zmek i\u00e7in farkl\u0131 yakla\u015f\u0131mlar kullan\u0131labilir; ancak en yayg\u0131n ve etkili y\u00f6ntemlerden biri kayan pencere (sliding window) algoritmas\u0131d\u0131r.","og_url":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/","og_site_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","article_published_time":"2024-11-19T12:30:46+00:00","author":"Fatih Soysal","twitter_card":"summary_large_image","twitter_misc":{"Yazan:":"Fatih Soysal","Tahmini okuma s\u00fcresi":"3 dakika"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#article","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/"},"author":{"name":"Fatih Soysal","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"headline":"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi","datePublished":"2024-11-19T12:30:46+00:00","mainEntityOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/"},"wordCount":450,"commentCount":0,"publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#respond"]}],"copyrightYear":"2024","copyrightHolder":{"@id":"https:\/\/fatihsoysal.com\/blog\/#organization"}},{"@type":"WebPage","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/","url":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/","name":"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/#website"},"datePublished":"2024-11-19T12:30:46+00:00","description":"LeetCode'un 3. problemi, \"En Uzun Tekrarlanmayan Altdizi\" (Longest Substring Without Repeating Characters) problemidir. Bu problem, verilen bir string i\u00e7inde tekrar eden karakter i\u00e7ermeyen en uzun altdizinin uzunlu\u011funu bulmay\u0131 gerektirir. \u00d6rne\u011fin, \"abcabcbb\" stringi i\u00e7in en uzun tekrarlanmayan altdizi \"abc\" olup, uzunlu\u011fu 3't\u00fcr. Bu problemi \u00e7\u00f6zmek i\u00e7in farkl\u0131 yakla\u015f\u0131mlar kullan\u0131labilir; ancak en yayg\u0131n ve etkili y\u00f6ntemlerden biri kayan pencere (sliding window) algoritmas\u0131d\u0131r.","breadcrumb":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Anasayfa","item":"https:\/\/fatihsoysal.com\/blog\/"},{"@type":"ListItem","position":2,"name":"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi"}]},{"@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\/4301","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=4301"}],"version-history":[{"count":0,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/4301\/revisions"}],"wp:attachment":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/media?parent=4301"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/categories?post=4301"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/tags?post=4301"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}

{"id":4301,"date":"2024-11-19T15:30:46","date_gmt":"2024-11-19T12:30:46","guid":{"rendered":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/"},"modified":"2024-11-19T15:30:46","modified_gmt":"2024-11-19T12:30:46","slug":"leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi","status":"publish","type":"post","link":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/","title":{"rendered":"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi"},"content":{"rendered":"

“`html
\n
\n
\n
\n
\n LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi<\/title><br \/>\n<\/head><br \/>\n<body><\/p>\n<p>LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi<\/p>\n<p>LeetCode’un 3. problemi, “En Uzun Tekrarlanmayan Altdizi” (Longest Substring Without Repeating Characters) problemidir. Bu problem, verilen bir string i\u00e7inde tekrar eden karakter i\u00e7ermeyen en uzun altdizinin uzunlu\u011funu bulmay\u0131 gerektirir. \u00d6rne\u011fin, “abcabcbb” stringi i\u00e7in en uzun tekrarlanmayan altdizi “abc” olup, uzunlu\u011fu 3’t\u00fcr. Bu problemi \u00e7\u00f6zmek i\u00e7in farkl\u0131 yakla\u015f\u0131mlar kullan\u0131labilir; ancak en yayg\u0131n ve etkili y\u00f6ntemlerden biri kayan pencere (sliding window) algoritmas\u0131d\u0131r.<\/p>\n<h2>Kayan Pencere Algoritmas\u0131 ile \u00c7\u00f6z\u00fcm<\/h2>\n<p>Kayan pencere algoritmas\u0131, verilen string \u00fczerinde iki i\u015faret\u00e7i (pointer) kullan\u0131r: ba\u015flang\u0131\u00e7 ve biti\u015f. Ba\u015flang\u0131\u00e7 i\u015faret\u00e7isi altdizinin ba\u015flang\u0131c\u0131n\u0131, biti\u015f i\u015faret\u00e7isi ise sonunu g\u00f6sterir. Algoritma, biti\u015f i\u015faret\u00e7isini sa\u011fa do\u011fru hareket ettirerek stringi tarar. E\u011fer biti\u015f i\u015faret\u00e7isinin g\u00f6sterdi\u011fi karakter, mevcut altdizi i\u00e7inde zaten varsa, ba\u015flang\u0131\u00e7 i\u015faret\u00e7isi, tekrar eden karakteri altdiziden \u00e7\u0131karana kadar sola do\u011fru hareket ettirilir. Bu i\u015flem, her ad\u0131mda en uzun tekrarlanmayan altdizinin uzunlu\u011funu g\u00fcncelleyerek devam eder.<\/p>\n<p>\u00d6rne\u011fin, “abcabcbb” stringi i\u00e7in algoritma \u015fu \u015fekilde \u00e7al\u0131\u015f\u0131r:<\/p>\n<ol>\n<li>Ba\u015flang\u0131\u00e7 ve biti\u015f i\u015faret\u00e7ileri “a” karakterinde ba\u015flar. Altdizi “a”, uzunlu\u011fu 1’dir.<\/li>\n<li>Biti\u015f i\u015faret\u00e7isi “b” ye hareket eder. Altdizi “ab”, uzunlu\u011fu 2’dir.<\/li>\n<li>Biti\u015f i\u015faret\u00e7isi “c” ye hareket eder. Altdizi “abc”, uzunlu\u011fu 3’t\u00fcr.<\/li>\n<li>Biti\u015f i\u015faret\u00e7isi “a” ya hareket eder. “a” zaten altdizi i\u00e7inde var. Ba\u015flang\u0131\u00e7 i\u015faret\u00e7isi “a” y\u0131 altdiziden \u00e7\u0131karmak i\u00e7in “b” ye hareket eder. Yeni altdizi “bca”, uzunlu\u011fu 3’t\u00fcr.<\/li>\n<li>Bu \u015fekilde devam ederek, en uzun tekrarlanmayan altdizi “abc” olarak bulunur ve uzunlu\u011fu 3 olarak kaydedilir.<\/li>\n<\/ol>\n<h2>Kod \u00d6rne\u011fi (Python)<\/h2>\n<pre><code>\ndef longest_substring_without_repeating_characters(s):\n n = len(s)\n ans = 0\n # mp stores the current index of a character\n mp = {}\n\n i = 0\n for j in range(n):\n if s[j] in mp:\n i = max(mp[s[j]], i)\n\n ans = max(ans, j - i + 1)\n mp[s[j]] = j + 1\n\n return ans\n\n# \u00d6rnek kullan\u0131m:\nstring = \"abcabcbb\"\nuzunluk = longest_substring_without_repeating_characters(string)\nprint(f\"'{string}' stringinin en uzun tekrarlanmayan altdizinin uzunlu\u011fu: {uzunluk}\")\n<\/code><\/pre>\n<p>Bu kod \u00f6rne\u011fi, kayan pencere algoritmas\u0131n\u0131 kullanarak problemi etkili bir \u015fekilde \u00e7\u00f6zer. Ancak, daha karma\u015f\u0131k senaryolar i\u00e7in daha optimize \u00e7\u00f6z\u00fcmler gerekebilir. \u00d6rne\u011fin, \u00e7ok b\u00fcy\u00fck stringler i\u00e7in daha verimli veri yap\u0131lar\u0131 kullan\u0131labilir.<\/p>\n<p>Sonu\u00e7 olarak, LeetCode Problem #3, temel algoritma kavramlar\u0131n\u0131 anlamak ve uygulamak i\u00e7in m\u00fckemmel bir \u00f6rnektir. Kayan pencere algoritmas\u0131, bu problem i\u00e7in olduk\u00e7a etkili bir \u00e7\u00f6z\u00fcm sunar ve daha geni\u015f bir yelpazede benzer problemlerin \u00e7\u00f6z\u00fcm\u00fcnde kullan\u0131labilir. Bu problem, veri yap\u0131lar\u0131 ve algoritmalar konusundaki bilgilerinizi geli\u015ftirmenize yard\u0131mc\u0131 olacakt\u0131r. Daha fazla bilgi i\u00e7in <a href=\"https:\/\/dev.to\/sunnat_qayumov\/leetcode-problem03-1bmj\">buraya<\/a> bakabilirsiniz. Kendi algoritma ve veri yap\u0131lar\u0131 \u00e7al\u0131\u015fmalar\u0131n\u0131z i\u00e7in de <a href=\"https:\/\/fatihsoysal.com\">fatihsoysal.com<\/a> sitesini ziyaret edebilirsiniz.<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/via.placeholder.com\/500x300?text=Kayan+Pencere+\u0130ll\u00fcstrasyonu\" alt=\"Kayan Pencere \u0130ll\u00fcstrasyonu\"><\/p>\n<p>#Etiketler: LeetCode, Problem 3, En Uzun Tekrarlanmayan Altdizi, Kayan Pencere Algoritmas\u0131, Sliding Window, Python, Algoritma, Veri Yap\u0131lar\u0131, Programlama, Fatih Soysal<\/p>\n<p><\/body><br \/>\n<\/html><br \/>\n“`<\/p>\n","protected":false},"excerpt":{"rendered":"“`html LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi LeetCode’un 3. problemi,…","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-4301","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-genel","7":"cs-entry","8":"cs-video-wrap"},"yoast_head":"\n<title>LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi<\/title>\n<meta name=\"description\" content=\"LeetCode'un 3. problemi, "En Uzun Tekrarlanmayan Altdizi" (Longest Substring Without Repeating Characters) problemidir. Bu problem, verilen bir string i\u00e7inde tekrar eden karakter i\u00e7ermeyen en uzun altdizinin uzunlu\u011funu bulmay\u0131 gerektirir. \u00d6rne\u011fin, "abcabcbb" stringi i\u00e7in en uzun tekrarlanmayan altdizi "abc" olup, uzunlu\u011fu 3't\u00fcr. Bu problemi \u00e7\u00f6zmek i\u00e7in farkl\u0131 yakla\u015f\u0131mlar kullan\u0131labilir; ancak en yayg\u0131n ve etkili y\u00f6ntemlerden biri kayan pencere (sliding window) algoritmas\u0131d\u0131r.\" \/>\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-problem-3-en-uzun-tekrarlanmayan-altdizi\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi\" \/>\n<meta property=\"og:description\" content=\"LeetCode'un 3. problemi, "En Uzun Tekrarlanmayan Altdizi" (Longest Substring Without Repeating Characters) problemidir. Bu problem, verilen bir string i\u00e7inde tekrar eden karakter i\u00e7ermeyen en uzun altdizinin uzunlu\u011funu bulmay\u0131 gerektirir. \u00d6rne\u011fin, "abcabcbb" stringi i\u00e7in en uzun tekrarlanmayan altdizi "abc" olup, uzunlu\u011fu 3't\u00fcr. Bu problemi \u00e7\u00f6zmek i\u00e7in farkl\u0131 yakla\u015f\u0131mlar kullan\u0131labilir; ancak en yayg\u0131n ve etkili y\u00f6ntemlerden biri kayan pencere (sliding window) algoritmas\u0131d\u0131r.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/\" \/>\n<meta property=\"og:site_name\" content=\"Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2024-11-19T12:30:46+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=\"3 dakika\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/\"},\"author\":{\"name\":\"Fatih Soysal\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"headline\":\"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi\",\"datePublished\":\"2024-11-19T12:30:46+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/\"},\"wordCount\":450,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#respond\"]}],\"copyrightYear\":\"2024\",\"copyrightHolder\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/\",\"name\":\"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\"},\"datePublished\":\"2024-11-19T12:30:46+00:00\",\"description\":\"LeetCode'un 3. problemi, \\\"En Uzun Tekrarlanmayan Altdizi\\\" (Longest Substring Without Repeating Characters) problemidir. Bu problem, verilen bir string i\u00e7inde tekrar eden karakter i\u00e7ermeyen en uzun altdizinin uzunlu\u011funu bulmay\u0131 gerektirir. \u00d6rne\u011fin, \\\"abcabcbb\\\" stringi i\u00e7in en uzun tekrarlanmayan altdizi \\\"abc\\\" olup, uzunlu\u011fu 3't\u00fcr. Bu problemi \u00e7\u00f6zmek i\u00e7in farkl\u0131 yakla\u015f\u0131mlar kullan\u0131labilir; ancak en yayg\u0131n ve etkili y\u00f6ntemlerden biri kayan pencere (sliding window) algoritmas\u0131d\u0131r.\",\"breadcrumb\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Anasayfa\",\"item\":\"https:\/\/fatihsoysal.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi\"}]},{\"@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_head_json":{"title":"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi","description":"LeetCode'un 3. problemi, \"En Uzun Tekrarlanmayan Altdizi\" (Longest Substring Without Repeating Characters) problemidir. Bu problem, verilen bir string i\u00e7inde tekrar eden karakter i\u00e7ermeyen en uzun altdizinin uzunlu\u011funu bulmay\u0131 gerektirir. \u00d6rne\u011fin, \"abcabcbb\" stringi i\u00e7in en uzun tekrarlanmayan altdizi \"abc\" olup, uzunlu\u011fu 3't\u00fcr. Bu problemi \u00e7\u00f6zmek i\u00e7in farkl\u0131 yakla\u015f\u0131mlar kullan\u0131labilir; ancak en yayg\u0131n ve etkili y\u00f6ntemlerden biri kayan pencere (sliding window) algoritmas\u0131d\u0131r.","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-problem-3-en-uzun-tekrarlanmayan-altdizi\/","og_locale":"tr_TR","og_type":"article","og_title":"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi","og_description":"LeetCode'un 3. problemi, \"En Uzun Tekrarlanmayan Altdizi\" (Longest Substring Without Repeating Characters) problemidir. Bu problem, verilen bir string i\u00e7inde tekrar eden karakter i\u00e7ermeyen en uzun altdizinin uzunlu\u011funu bulmay\u0131 gerektirir. \u00d6rne\u011fin, \"abcabcbb\" stringi i\u00e7in en uzun tekrarlanmayan altdizi \"abc\" olup, uzunlu\u011fu 3't\u00fcr. Bu problemi \u00e7\u00f6zmek i\u00e7in farkl\u0131 yakla\u015f\u0131mlar kullan\u0131labilir; ancak en yayg\u0131n ve etkili y\u00f6ntemlerden biri kayan pencere (sliding window) algoritmas\u0131d\u0131r.","og_url":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/","og_site_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","article_published_time":"2024-11-19T12:30:46+00:00","author":"Fatih Soysal","twitter_card":"summary_large_image","twitter_misc":{"Yazan:":"Fatih Soysal","Tahmini okuma s\u00fcresi":"3 dakika"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#article","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/"},"author":{"name":"Fatih Soysal","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"headline":"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi","datePublished":"2024-11-19T12:30:46+00:00","mainEntityOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/"},"wordCount":450,"commentCount":0,"publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#respond"]}],"copyrightYear":"2024","copyrightHolder":{"@id":"https:\/\/fatihsoysal.com\/blog\/#organization"}},{"@type":"WebPage","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/","url":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/","name":"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/#website"},"datePublished":"2024-11-19T12:30:46+00:00","description":"LeetCode'un 3. problemi, \"En Uzun Tekrarlanmayan Altdizi\" (Longest Substring Without Repeating Characters) problemidir. Bu problem, verilen bir string i\u00e7inde tekrar eden karakter i\u00e7ermeyen en uzun altdizinin uzunlu\u011funu bulmay\u0131 gerektirir. \u00d6rne\u011fin, \"abcabcbb\" stringi i\u00e7in en uzun tekrarlanmayan altdizi \"abc\" olup, uzunlu\u011fu 3't\u00fcr. Bu problemi \u00e7\u00f6zmek i\u00e7in farkl\u0131 yakla\u015f\u0131mlar kullan\u0131labilir; ancak en yayg\u0131n ve etkili y\u00f6ntemlerden biri kayan pencere (sliding window) algoritmas\u0131d\u0131r.","breadcrumb":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Anasayfa","item":"https:\/\/fatihsoysal.com\/blog\/"},{"@type":"ListItem","position":2,"name":"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi"}]},{"@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\/4301","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=4301"}],"version-history":[{"count":0,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/4301\/revisions"}],"wp:attachment":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/media?parent=4301"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/categories?post=4301"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/tags?post=4301"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}