{"id":6802,"date":"2024-12-16T20:00:16","date_gmt":"2024-12-16T17:00:16","guid":{"rendered":"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/"},"modified":"2024-12-16T20:00:16","modified_gmt":"2024-12-16T17:00:16","slug":"leetcode-238-kendi-disindaki-carpim-javascript-cozumu","status":"publish","type":"post","link":"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/","title":{"rendered":"LeetCode 238: Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m &#8211; JavaScript \u00c7\u00f6z\u00fcm\u00fc"},"content":{"rendered":"<p><body><\/p>\n<p>LeetCode 238: Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m &#8211; JavaScript \u00c7\u00f6z\u00fcm\u00fc<\/p>\n<p>Bu yaz\u0131da, LeetCode&#8217;un olduk\u00e7a pop\u00fcler problemlerinden biri olan &#8220;Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m&#8221; (Product of Array Except Self) problemini JavaScript kullanarak nas\u0131l \u00e7\u00f6zebilece\u011fimize bakaca\u011f\u0131z.  Problem k\u0131saca, verilen bir dizide her bir eleman\u0131n, kendisini hari\u00e7 tutan di\u011fer t\u00fcm elemanlar\u0131n \u00e7arp\u0131m\u0131n\u0131 i\u00e7eren yeni bir dizi olu\u015fturmay\u0131 gerektiriyor.<\/p>\n<p>\u00d6rne\u011fin, <code>[1,2,3,4]<\/code> dizisi i\u00e7in \u00e7\u0131kt\u0131 <code>[24,12,8,6]<\/code> olmal\u0131d\u0131r. \u00c7\u00fcnk\u00fc 24 = 2*3*4, 12 = 1*3*4, 8 = 1*2*4 ve 6 = 1*2*3&#8217;t\u00fcr.<\/p>\n<h2>\u00c7\u00f6z\u00fcm Y\u00f6ntemleri<\/h2>\n<p>Bu problemi \u00e7\u00f6zmek i\u00e7in birka\u00e7 farkl\u0131 yakla\u015f\u0131m mevcuttur.  En yayg\u0131n ve verimli olanlar\u0131ndan ikisini inceleyelim:<\/p>\n<h3>1.  \u0130ki Ge\u00e7itli (Two Pass) Y\u00f6ntem<\/h3>\n<p>Bu y\u00f6ntemde, \u00f6ncelikle her eleman\u0131n sa\u011f\u0131ndaki elemanlar\u0131n \u00e7arp\u0131m\u0131n\u0131 hesaplayan bir dizi olu\u015fturuyoruz.  Ard\u0131ndan, ikinci bir ge\u00e7i\u015fte, her eleman\u0131n solundaki elemanlar\u0131n \u00e7arp\u0131m\u0131n\u0131 hesaplay\u0131p, bu iki diziyi birle\u015ftiriyoruz.  Bu y\u00f6ntem, her eleman\u0131n hesaplanmas\u0131 i\u00e7in sadece iki ge\u00e7i\u015f gerektirir ve olduk\u00e7a verimlidir.<\/p>\n<pre><code class=\"language-javascript\">\n\/**\n * @param {number[]} nums\n * @return {number[]}\n *\/\nvar productExceptSelf = function(nums) {\n    const n = nums.length;\n    const result = new Array(n).fill(1); \/\/ Sonu\u00e7 dizisini 1'lerle ba\u015flat\u0131yoruz\n\n    \/\/ Sa\u011fdaki \u00e7arp\u0131mlar\u0131 hesapla\n    let rightProduct = 1;\n    for (let i = n - 1; i >= 0; i--) {\n        result[i] *= rightProduct;\n        rightProduct *= nums[i];\n    }\n\n    \/\/ Soldaki \u00e7arp\u0131mlar\u0131 hesapla ve sonu\u00e7 dizisini g\u00fcncelle\n    let leftProduct = 1;\n    for (let i = 0; i < n; i++) {\n        result[i] *= leftProduct;\n        leftProduct *= nums[i];\n    }\n\n    return result;\n};\n<\/code><\/pre>\n<h3>2.  Tek Ge\u00e7itli (One Pass) Y\u00f6ntem (Daha karma\u015f\u0131k ancak daha az bellek kullan\u0131r)<\/h3>\n<p>Bu y\u00f6ntem, daha az ek bellek kullan\u0131r, fakat kodun anla\u015f\u0131l\u0131rl\u0131\u011f\u0131 azalabilir.  Bu y\u00f6ntemde, ayn\u0131 anda hem sa\u011f hem de sol \u00e7arp\u0131mlar\u0131 hesaplayarak tek bir ge\u00e7i\u015fte sonucu elde ederiz.<\/p>\n<p>Ancak, bu y\u00f6ntemin uygulanmas\u0131 daha karma\u015f\u0131kt\u0131r ve hata yapma olas\u0131l\u0131\u011f\u0131 daha y\u00fcksektir. Bu y\u00fczden, \u00f6zellikle performans \u00e7ok kritik olmad\u0131\u011f\u0131 s\u00fcrece, iki ge\u00e7i\u015fli y\u00f6ntemi tercih etmek daha iyi olabilir.<\/p>\n<h2>Performans Kar\u015f\u0131la\u015ft\u0131rmas\u0131<\/h2>\n<p>\u0130ki y\u00f6ntemin de zaman karma\u015f\u0131kl\u0131\u011f\u0131 O(n) iken,  iki ge\u00e7i\u015fli y\u00f6ntem daha anla\u015f\u0131l\u0131r ve debug'lamas\u0131 daha kolayd\u0131r.  Bellek kullan\u0131m\u0131 a\u00e7\u0131s\u0131ndan, tek ge\u00e7i\u015fli y\u00f6ntem daha az bellek t\u00fcketir.<\/p>\n<p>Sonu\u00e7 olarak, problemi \u00e7\u00f6zmek i\u00e7in en uygun y\u00f6ntem, projenin \u00f6zel gereksinimlerine ve \u00f6nceliklerine ba\u011fl\u0131 olarak de\u011fi\u015fir.<\/p>\n<h2>Sonu\u00e7<\/h2>\n<p>Bu yaz\u0131da, LeetCode'un \"Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m\" problemini \u00e7\u00f6zmek i\u00e7in iki farkl\u0131 JavaScript \u00e7\u00f6z\u00fcm\u00fc inceledik. Her iki \u00e7\u00f6z\u00fcm\u00fcn de avantajlar\u0131 ve dezavantajlar\u0131 vard\u0131r.  Do\u011fru \u00e7\u00f6z\u00fcm\u00fc se\u00e7erken, kodun okunabilirli\u011fi, performans gereksinimleri ve bellek kullan\u0131m\u0131 gibi fakt\u00f6rleri g\u00f6z \u00f6n\u00fcnde bulundurmak \u00f6nemlidir.  Daha fazla LeetCode \u00e7\u00f6z\u00fcm\u00fc ve JavaScript ile ilgili i\u00e7erikler i\u00e7in <a href=\"https:\/\/fatihsoysal.com\">fatihsoysal.com<\/a> sitesini ziyaret edebilirsiniz.<\/p>\n<p>Umar\u0131m bu makale size yard\u0131mc\u0131 olmu\u015ftur!  Ba\u015fka sorular\u0131n\u0131z varsa veya konuyla ilgili daha fazla bilgi edinmek istiyorsan\u0131z, l\u00fctfen yorumlarda belirtin.<\/p>\n<p>Faydal\u0131 bulabilece\u011finiz kaynaklar:<\/p>\n<ul>\n<li><a href=\"https:\/\/dev.to\/rahulgithubweb\/leetcode-challenge-238-product-of-array-except-self-javascript-solution-1l83\">Orijinal \u0130ngilizce Makale<\/a><\/li>\n<li><a href=\"https:\/\/leetcode.com\/problems\/product-of-array-except-self\/\">LeetCode Problemi Sayfas\u0131<\/a><\/li>\n<\/ul>\n<p>#Etiketler: LeetCode, JavaScript, Algoritma, Dizi, \u00c7arp\u0131m, Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m, \u0130ki Ge\u00e7itli Y\u00f6ntem, Tek Ge\u00e7itli Y\u00f6ntem, Performans, Kod, Programlama, Tutorial<\/p>\n<p><\/body><br \/>\n<\/html><\/p>\n","protected":false},"excerpt":{"rendered":"LeetCode 238: Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m &#8211; JavaScript \u00c7\u00f6z\u00fcm\u00fc Bu yaz\u0131da, LeetCode&#8217;un olduk\u00e7a pop\u00fcler problemlerinden biri olan &#8220;Kendi D\u0131\u015f\u0131ndaki&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-6802","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 238: Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m - JavaScript \u00c7\u00f6z\u00fcm\u00fc<\/title>\n<meta name=\"description\" content=\"Bu yaz\u0131da, LeetCode&#039;un olduk\u00e7a pop\u00fcler problemlerinden biri olan &quot;Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m&quot; (Product of Array Except Self) problemini JavaScript kullanarak nas\u0131l \u00e7\u00f6zebilece\u011fimize bakaca\u011f\u0131z. Problem k\u0131saca, verilen bir dizide her bir eleman\u0131n, kendisini hari\u00e7 tutan di\u011fer t\u00fcm elemanlar\u0131n \u00e7arp\u0131m\u0131n\u0131 i\u00e7eren yeni bir dizi olu\u015fturmay\u0131 gerektiriyor.\" \/>\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-238-kendi-disindaki-carpim-javascript-cozumu\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"LeetCode 238: Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m - JavaScript \u00c7\u00f6z\u00fcm\u00fc\" \/>\n<meta property=\"og:description\" content=\"Bu yaz\u0131da, LeetCode&#039;un olduk\u00e7a pop\u00fcler problemlerinden biri olan &quot;Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m&quot; (Product of Array Except Self) problemini JavaScript kullanarak nas\u0131l \u00e7\u00f6zebilece\u011fimize bakaca\u011f\u0131z. Problem k\u0131saca, verilen bir dizide her bir eleman\u0131n, kendisini hari\u00e7 tutan di\u011fer t\u00fcm elemanlar\u0131n \u00e7arp\u0131m\u0131n\u0131 i\u00e7eren yeni bir dizi olu\u015fturmay\u0131 gerektiriyor.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/\" \/>\n<meta property=\"og:site_name\" content=\"Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2024-12-16T17:00:16+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-238-kendi-disindaki-carpim-javascript-cozumu\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/\"},\"author\":{\"name\":\"Fatih Soysal\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"headline\":\"LeetCode 238: Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m &#8211; JavaScript \u00c7\u00f6z\u00fcm\u00fc\",\"datePublished\":\"2024-12-16T17:00:16+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/\"},\"wordCount\":481,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/#respond\"]}],\"copyrightYear\":\"2024\",\"copyrightHolder\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/\",\"name\":\"LeetCode 238: Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m - JavaScript \u00c7\u00f6z\u00fcm\u00fc\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\"},\"datePublished\":\"2024-12-16T17:00:16+00:00\",\"description\":\"Bu yaz\u0131da, LeetCode'un olduk\u00e7a pop\u00fcler problemlerinden biri olan \\\"Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m\\\" (Product of Array Except Self) problemini JavaScript kullanarak nas\u0131l \u00e7\u00f6zebilece\u011fimize bakaca\u011f\u0131z. Problem k\u0131saca, verilen bir dizide her bir eleman\u0131n, kendisini hari\u00e7 tutan di\u011fer t\u00fcm elemanlar\u0131n \u00e7arp\u0131m\u0131n\u0131 i\u00e7eren yeni bir dizi olu\u015fturmay\u0131 gerektiriyor.\",\"breadcrumb\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Anasayfa\",\"item\":\"https:\/\/fatihsoysal.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"LeetCode 238: Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m &#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 238: Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m - JavaScript \u00c7\u00f6z\u00fcm\u00fc","description":"Bu yaz\u0131da, LeetCode'un olduk\u00e7a pop\u00fcler problemlerinden biri olan \"Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m\" (Product of Array Except Self) problemini JavaScript kullanarak nas\u0131l \u00e7\u00f6zebilece\u011fimize bakaca\u011f\u0131z. Problem k\u0131saca, verilen bir dizide her bir eleman\u0131n, kendisini hari\u00e7 tutan di\u011fer t\u00fcm elemanlar\u0131n \u00e7arp\u0131m\u0131n\u0131 i\u00e7eren yeni bir dizi olu\u015fturmay\u0131 gerektiriyor.","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-238-kendi-disindaki-carpim-javascript-cozumu\/","og_locale":"tr_TR","og_type":"article","og_title":"LeetCode 238: Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m - JavaScript \u00c7\u00f6z\u00fcm\u00fc","og_description":"Bu yaz\u0131da, LeetCode'un olduk\u00e7a pop\u00fcler problemlerinden biri olan \"Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m\" (Product of Array Except Self) problemini JavaScript kullanarak nas\u0131l \u00e7\u00f6zebilece\u011fimize bakaca\u011f\u0131z. Problem k\u0131saca, verilen bir dizide her bir eleman\u0131n, kendisini hari\u00e7 tutan di\u011fer t\u00fcm elemanlar\u0131n \u00e7arp\u0131m\u0131n\u0131 i\u00e7eren yeni bir dizi olu\u015fturmay\u0131 gerektiriyor.","og_url":"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/","og_site_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","article_published_time":"2024-12-16T17:00:16+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-238-kendi-disindaki-carpim-javascript-cozumu\/#article","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/"},"author":{"name":"Fatih Soysal","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"headline":"LeetCode 238: Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m &#8211; JavaScript \u00c7\u00f6z\u00fcm\u00fc","datePublished":"2024-12-16T17:00:16+00:00","mainEntityOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/"},"wordCount":481,"commentCount":0,"publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/#respond"]}],"copyrightYear":"2024","copyrightHolder":{"@id":"https:\/\/fatihsoysal.com\/blog\/#organization"}},{"@type":"WebPage","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/","url":"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/","name":"LeetCode 238: Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m - JavaScript \u00c7\u00f6z\u00fcm\u00fc","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/#website"},"datePublished":"2024-12-16T17:00:16+00:00","description":"Bu yaz\u0131da, LeetCode'un olduk\u00e7a pop\u00fcler problemlerinden biri olan \"Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m\" (Product of Array Except Self) problemini JavaScript kullanarak nas\u0131l \u00e7\u00f6zebilece\u011fimize bakaca\u011f\u0131z. Problem k\u0131saca, verilen bir dizide her bir eleman\u0131n, kendisini hari\u00e7 tutan di\u011fer t\u00fcm elemanlar\u0131n \u00e7arp\u0131m\u0131n\u0131 i\u00e7eren yeni bir dizi olu\u015fturmay\u0131 gerektiriyor.","breadcrumb":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-238-kendi-disindaki-carpim-javascript-cozumu\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Anasayfa","item":"https:\/\/fatihsoysal.com\/blog\/"},{"@type":"ListItem","position":2,"name":"LeetCode 238: Kendi D\u0131\u015f\u0131ndaki \u00c7arp\u0131m &#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\/6802","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=6802"}],"version-history":[{"count":0,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/6802\/revisions"}],"wp:attachment":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/media?parent=6802"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/categories?post=6802"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/tags?post=6802"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}