{"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 15: 3Sum JavaScript \u00c7\u00f6z\u00fcm\u00fc","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"Fvzy5vRfv2\"><a href=\"https:\/\/fatihsoysal.com\/blog\/leetcode-15-3sum-javascript-cozumu\/\">LeetCode 15: 3Sum JavaScript \u00c7\u00f6z\u00fcm\u00fc<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/fatihsoysal.com\/blog\/leetcode-15-3sum-javascript-cozumu\/embed\/#?secret=Fvzy5vRfv2\" width=\"600\" height=\"338\" title=\"&#8220;LeetCode 15: 3Sum JavaScript \u00c7\u00f6z\u00fcm\u00fc&#8221; &#8212; Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" data-secret=\"Fvzy5vRfv2\" 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":"Bu makalede, LeetCode'un pop\u00fcler problemlerinden biri olan \"3Sum\" problemine JavaScript ile nas\u0131l \u00e7\u00f6z\u00fcm \u00fcretebilece\u011finizi detayl\u0131 olarak ele alaca\u011f\u0131z. Hedefimiz, verilen bir dizide toplam\u0131 s\u0131f\u0131ra e\u015fit olan \u00fc\u00e7 say\u0131n\u0131n t\u00fcm olas\u0131 kombinasyonlar\u0131n\u0131 bulmak. Bu problem, algoritma ve veri yap\u0131lar\u0131 bilginizi test eden zorlu bir problemdir. Ancak do\u011fru yakla\u015f\u0131mla, verimli bir \u00e7\u00f6z\u00fcm geli\u015ftirmek m\u00fcmk\u00fcnd\u00fcr."}