{"version":"1.0","provider_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","provider_url":"https:\/\/fatihsoysal.com\/blog","author_name":"Fatih Soysal","author_url":"https:\/\/fatihsoysal.com\/blog\/author\/fatihsoysal\/","title":"LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"FGb5jb6f8t\"><a href=\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/\">LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/fatihsoysal.com\/blog\/leetcode-problem-3-en-uzun-tekrarlanmayan-altdizi\/embed\/#?secret=FGb5jb6f8t\" width=\"600\" height=\"338\" title=\"&#8220;LeetCode Problem #3: En Uzun Tekrarlanmayan Altdizi&#8221; &#8212; Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" data-secret=\"FGb5jb6f8t\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" class=\"wp-embedded-content\"><\/iframe><script>\n\/*! This file is auto-generated *\/\n!function(d,l){\"use strict\";l.querySelector&&d.addEventListener&&\"undefined\"!=typeof URL&&(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&&!\/[^a-zA-Z0-9]\/.test(t.secret)){for(var s,r,n,a=l.querySelectorAll('iframe[data-secret=\"'+t.secret+'\"]'),o=l.querySelectorAll('blockquote[data-secret=\"'+t.secret+'\"]'),c=new RegExp(\"^https?:$\",\"i\"),i=0;i<o.length;i++)o[i].style.display=\"none\";for(i=0;i<a.length;i++)s=a[i],e.source===s.contentWindow&&(s.removeAttribute(\"style\"),\"height\"===t.message?(1e3<(r=parseInt(t.value,10))?r=1e3:~~r<200&&(r=200),s.height=r):\"link\"===t.message&&(r=new URL(s.getAttribute(\"src\")),n=new URL(t.value),c.test(n.protocol))&&n.host===r.host&&l.activeElement===s&&(d.top.location.href=t.value))}},d.addEventListener(\"message\",d.wp.receiveEmbedMessage,!1),l.addEventListener(\"DOMContentLoaded\",function(){for(var e,t,s=l.querySelectorAll(\"iframe.wp-embedded-content\"),r=0;r<s.length;r++)(t=(e=s[r]).getAttribute(\"data-secret\"))||(t=Math.random().toString(36).substring(2,12),e.src+=\"#?secret=\"+t,e.setAttribute(\"data-secret\",t)),e.contentWindow.postMessage({message:\"ready\",secret:t},\"*\")},!1)))}(window,document);\n<\/script>\n","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."}