{"id":27828,"date":"2025-08-19T14:00:23","date_gmt":"2025-08-19T11:00:23","guid":{"rendered":"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/"},"modified":"2025-08-19T14:00:23","modified_gmt":"2025-08-19T11:00:23","slug":"leetcode-242-gecerli-anagram-kontrolu","status":"publish","type":"post","link":"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/","title":{"rendered":"LeetCode #242: Ge\u00e7erli Anagram Kontrol\u00fc"},"content":{"rendered":"<p>LeetCode #242: Ge\u00e7erli Anagram Kontrol\u00fc<\/p>\n<p>\u0130ki stringin birbirinin anagram\u0131 olup olmad\u0131\u011f\u0131n\u0131 kontrol etmek, programlamada s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan bir problemdir.  Bu makalede, LeetCode&#8217;un #242 sorusu olan &#8220;Ge\u00e7erli Anagram&#8221; problemini ele alaca\u011f\u0131z.  Farkl\u0131 \u00e7\u00f6z\u00fcm y\u00f6ntemlerini kar\u015f\u0131la\u015ft\u0131rarak, performans analizleri yapaca\u011f\u0131z ve ileri d\u00fczey optimizasyon tekniklerini inceleyece\u011fiz.  Bu rehber, yeni ba\u015flayanlardan deneyimli geli\u015ftiricilere kadar herkes i\u00e7in faydal\u0131 bilgiler sunmay\u0131 ama\u00e7lamaktad\u0131r.<\/p>\n<h2>Anagram Nedir? Temel Kavramlar<\/h2>\n<p>Bir anagram, harflerinin s\u0131ras\u0131 de\u011fi\u015ftirilerek farkl\u0131 bir kelime veya ifade olu\u015fturuldu\u011fu bir kelimedir.  \u00d6rne\u011fin, &#8220;listen&#8221; kelimesinin anagramlar\u0131 aras\u0131nda &#8220;silent&#8221; ve &#8220;silent&#8221; yer al\u0131r.  Anagram kontrol\u00fc, iki string&#8217;in ayn\u0131 harfleri ayn\u0131 say\u0131da i\u00e7erip i\u00e7ermedi\u011fini kontrol etmeyi gerektirir.  Bu kontrol, string&#8217;lerin uzunluklar\u0131n\u0131 kar\u015f\u0131la\u015ft\u0131rarak ba\u015flayabilir.  E\u011fer uzunluklar farkl\u0131ysa, anagram olamazlar.  Uzunluklar ayn\u0131 ise, daha detayl\u0131 bir kontrol gereklidir.  Bu kontrol, genellikle harflerin frekanslar\u0131n\u0131 sayarak yap\u0131l\u0131r.<\/p>\n<p>\u00d6rne\u011fin, &#8220;abbc&#8221; ve &#8220;babc&#8221; string&#8217;lerini ele alal\u0131m. Her iki string&#8217;in de uzunlu\u011fu 4&#8217;t\u00fcr.  &#8220;a&#8221; harfi her iki string&#8217;de 1 kere, &#8220;b&#8221; harfi 2 kere ve &#8220;c&#8221; harfi 1 kere ge\u00e7mektedir. Bu nedenle, bu iki string birbirinin anagram\u0131d\u0131r. Ancak &#8220;abc&#8221; ve &#8220;abd&#8221; stringleri farkl\u0131 harf i\u00e7erdikleri i\u00e7in anagram de\u011fillerdir.<\/p>\n<h2>Anagram Kontrol\u00fc Nas\u0131l Yap\u0131l\u0131r? (Yeni Ba\u015flayan Seviyesi)<\/h2>\n<p>En basit yakla\u015f\u0131m, her iki string&#8217;i de harflerine ay\u0131rarak, her harfin say\u0131s\u0131n\u0131 ayr\u0131 ayr\u0131 saymakt\u0131r.  Bu say\u0131mlar e\u015fle\u015fiyorsa, stringler anagramd\u0131r.  Python&#8217;da bu, <code>Counter<\/code> s\u0131n\u0131f\u0131 kullan\u0131larak kolayca yap\u0131labilir:<\/p>\n<pre><code class=\"language-python\">from collections import Counter\n\ndef isAnagram_basic(s, t):\n    \"\"\"\n    Yeni ba\u015flayanlar i\u00e7in basit bir anagram kontrol\u00fc fonksiyonu.\n    \"\"\"\n    return Counter(s) == Counter(t)\n\nprint(isAnagram_basic(\"listen\", \"silent\"))  # True\nprint(isAnagram_basic(\"abc\", \"abd\"))      # False<\/pre>\n<p><\/code><\/p>\n<p>Bu y\u00f6ntem olduk\u00e7a anla\u015f\u0131l\u0131r ve okunabilirdir. Ancak, b\u00fcy\u00fck stringler i\u00e7in performans sorunlar\u0131na yol a\u00e7abilir.  Zira, her bir karakter i\u00e7in bir i\u015flem yap\u0131lmas\u0131 gerekmektedir.  Daha verimli \u00e7\u00f6z\u00fcmler i\u00e7in ileri d\u00fczey tekniklere ihtiya\u00e7 duyulabilir.<\/p>\n<h2>Anagram Kontrol\u00fc Nas\u0131l Yap\u0131l\u0131r? (Orta Seviye)<\/h2>\n<p>Performans\u0131 art\u0131rmak i\u00e7in, string'leri s\u0131ralamay\u0131 deneyebiliriz.  E\u011fer iki string'in s\u0131ralanm\u0131\u015f halleri ayn\u0131ysa, anagramd\u0131rlar.  Bu y\u00f6ntem, \u00f6zellikle b\u00fcy\u00fck stringler i\u00e7in daha verimlidir, \u00e7\u00fcnk\u00fc s\u0131ralama i\u015flemi genellikle do\u011frusal zaman karma\u015f\u0131kl\u0131\u011f\u0131na sahiptir.  Python'da bu, <code>sorted()<\/code> fonksiyonu kullan\u0131larak ger\u00e7ekle\u015ftirilebilir:<\/p>\n<pre><code class=\"language-python\">def isAnagram_sorted(s, t):\n    \"\"\"\n    Orta seviye i\u00e7in daha performansl\u0131 bir anagram kontrol\u00fc.\n    \"\"\"\n    return sorted(s) == sorted(t)\n\nprint(isAnagram_sorted(\"listen\", \"silent\"))  # True\nprint(isAnagram_sorted(\"abc\", \"abd\"))      # False<\/pre>\n<p><\/code><\/p>\n<p>Bu y\u00f6ntem, \u00f6nceki y\u00f6nteme g\u00f6re daha h\u0131zl\u0131d\u0131r \u00e7\u00fcnk\u00fc <code>Counter<\/code> s\u0131n\u0131f\u0131n\u0131n olu\u015fturulmas\u0131 ve kar\u015f\u0131la\u015ft\u0131r\u0131lmas\u0131 gibi ek i\u015flemlerden ka\u00e7\u0131n\u0131r.  Ancak, yine de, \u00e7ok b\u00fcy\u00fck stringler i\u00e7in yeterince verimli olmayabilir.  Bellek kullan\u0131m\u0131n\u0131n da artmas\u0131na neden olabilir.  Bu nedenle, daha geli\u015fmi\u015f \u00e7\u00f6z\u00fcmler ara\u015ft\u0131r\u0131lmal\u0131d\u0131r.<\/p>\n<h2>Anagram Kontrol\u00fc Nas\u0131l Yap\u0131l\u0131r? (\u0130leri D\u00fczey)<\/h2>\n<p>En verimli y\u00f6ntemlerden biri, bir harf dizisi kullanarak her harfin frekans\u0131n\u0131 saymakt\u0131r.  Bu y\u00f6ntem, sabit bir bellek kullan\u0131m\u0131 ve do\u011frusal zaman karma\u015f\u0131kl\u0131\u011f\u0131 sa\u011flar.  26 harfli \u0130ngilizce alfabesi i\u00e7in 26 elemanl\u0131 bir dizi kullanabiliriz:<\/p>\n<pre><code class=\"language-python\">def isAnagram_advanced(s, t):\n    \"\"\"\n    \u0130leri seviye i\u00e7in en verimli anagram kontrol\u00fc.\n    \"\"\"\n    if len(s) != len(t):\n        return False\n\n    char_counts = [0] * 26  # \u0130ngilizce alfabesi i\u00e7in 26 elemanl\u0131 dizi\n\n    for char in s:\n        char_counts[ord(char) - ord(&#039;a&#039;)] += 1\n\n    for char in t:\n        char_counts[ord(char) - ord(&#039;a&#039;)] -= 1\n        if char_counts[ord(char) - ord(&#039;a&#039;)] < 0:\n            return False\n\n    return all(count == 0 for count in char_counts)\n\n\nprint(isAnagram_advanced(\"listen\", \"silent\"))  # True\nprint(isAnagram_advanced(\"abc\", \"abd\"))      # False<\/pre>\n<p><\/code><\/p>\n<p>Bu y\u00f6ntem, her harfin ASCII de\u011ferini kullanarak do\u011frudan dizideki ilgili indekse eri\u015fir ve say\u0131m\u0131 g\u00fcnceller.  Bu, <code>Counter<\/code> s\u0131n\u0131f\u0131 veya s\u0131ralama i\u015flemlerine g\u00f6re daha h\u0131zl\u0131 ve daha az bellek t\u00fcketir. \u00d6zellikle b\u00fcy\u00fck veri setleri i\u00e7in \u00f6nemli bir performans art\u0131\u015f\u0131 sa\u011flar.<\/p>\n<h3>Performans Kar\u015f\u0131la\u015ft\u0131rmas\u0131<\/h3>\n<p>\u00dc\u00e7 farkl\u0131 y\u00f6ntemin performans\u0131n\u0131 kar\u015f\u0131la\u015ft\u0131ral\u0131m:<\/p>\n<p>| Y\u00f6ntem          | Zaman Karma\u015f\u0131kl\u0131\u011f\u0131 | Uzay Karma\u015f\u0131kl\u0131\u011f\u0131 |<br \/>\n|-----------------|--------------------|--------------------|<br \/>\n| <code>Counter<\/code>       | O(n)               | O(n)               |<br \/>\n| <code>sorted<\/code>         | O(n log n)         | O(n)               |<br \/>\n| Dizi kullan\u0131m\u0131   | O(n)               | O(1)               |<\/p>\n<p>G\u00f6r\u00fcld\u00fc\u011f\u00fc gibi, dizi kullan\u0131m\u0131 y\u00f6ntemi en iyi performansa sahiptir.  Ancak, bu y\u00f6ntemin alfabenin boyutu ile s\u0131n\u0131rl\u0131 oldu\u011funu unutmamak gerekir.  Farkl\u0131 karakter setleri i\u00e7in, bu y\u00f6ntemin uyarlanmas\u0131 gerekebilir.<\/p>\n<h2>Ger\u00e7ek D\u00fcnya Senaryolar\u0131<\/h2>\n<p>Anagram kontrol\u00fc, bir\u00e7ok ger\u00e7ek d\u00fcnya senaryosunda kullan\u0131labilir.  \u00d6rne\u011fin, bir arama motorunda, kullan\u0131c\u0131 yanl\u0131\u015f yaz\u0131lm\u0131\u015f bir kelime girdi\u011finde, olas\u0131 anagramlar \u00f6nerilebilir.  Ayr\u0131ca, \u015fifreleme algoritmalar\u0131nda, bir metnin anagram\u0131n\u0131 olu\u015fturmak, \u015fifreleme i\u015flemlerinde kullan\u0131labilir.  Bir ba\u015fka \u00f6rnek ise, biyoinformatik alan\u0131nda, iki DNA dizisinin birbirinin anagram\u0131 olup olmad\u0131\u011f\u0131n\u0131 kontrol etmek i\u00e7in kullan\u0131labilir. Bu da, genetik benzerlik ara\u015ft\u0131rmalar\u0131nda faydal\u0131 olabilir.<\/p>\n<h2>\u00d6\u011frenme Yol Haritas\u0131<\/h2>\n<p>Bu makalede anlat\u0131lan konular\u0131 \u00f6\u011frenmek i\u00e7in a\u015fa\u011f\u0131daki yol haritas\u0131n\u0131 takip edebilirsiniz:<\/p>\n<p>* <strong>Yeni Ba\u015flayan:<\/strong> <code>Counter<\/code> s\u0131n\u0131f\u0131n\u0131 \u00f6\u011frenin ve basit anagram kontrol\u00fc y\u00f6ntemini uygulay\u0131n.<br \/>\n* <strong>Orta Seviye:<\/strong> String s\u0131ralama y\u00f6ntemini uygulay\u0131n ve performans fark\u0131n\u0131 analiz edin.<br \/>\n* <strong>\u0130leri D\u00fczey:<\/strong> Dizi kullanarak geli\u015fmi\u015f anagram kontrol\u00fc y\u00f6ntemini uygulay\u0131n ve zaman ve bellek karma\u015f\u0131kl\u0131\u011f\u0131n\u0131 analiz edin.  Farkl\u0131 karakter setleri i\u00e7in y\u00f6nteminizi uyarlay\u0131n.<\/p>\n<h2>Sonu\u00e7<\/h2>\n<p>Bu makalede, LeetCode #242 sorusu olan \"Ge\u00e7erli Anagram\" problemini farkl\u0131 yakla\u015f\u0131mlar kullanarak inceledik.  Basit bir y\u00f6ntemden, daha verimli ve geli\u015fmi\u015f \u00e7\u00f6z\u00fcmlere kadar bir\u00e7ok farkl\u0131 teknik \u00fczerinde durduk.  Performans kar\u015f\u0131la\u015ft\u0131rmalar\u0131 yaparak, en uygun y\u00f6ntemi se\u00e7mek i\u00e7in gereken kriterleri ele ald\u0131k.  Umar\u0131m bu makale, anagram kontrol\u00fc konusunda daha fazla bilgi edinmenize ve problemleri daha etkili bir \u015fekilde \u00e7\u00f6zmenize yard\u0131mc\u0131 olmu\u015ftur. Daha fazla bilgi i\u00e7in <a href=\"https:\/\/fatihsoysal.com\">https:\/\/fatihsoysal.com<\/a> inceleyebilirsiniz.<\/p>\n<h2>S\u0131k\u00e7a Sorulan Sorular<\/h2>\n<ul>\n<li><b>Anagram kontrol\u00fc i\u00e7in en verimli y\u00f6ntem hangisidir?<\/b>  Genellikle, harf frekanslar\u0131n\u0131 saymak i\u00e7in bir dizi kullan\u0131m\u0131 en verimli y\u00f6ntemdir.  Ancak, veri k\u00fcmesinin boyutu ve karakter seti dikkate al\u0131nmal\u0131d\u0131r.<\/li>\n<li><b>B\u00fcy\u00fck stringler i\u00e7in hangi y\u00f6ntemi kullanmal\u0131y\u0131m?<\/b> B\u00fcy\u00fck stringler i\u00e7in dizi kullan\u0131m\u0131 y\u00f6ntemi tercih edilmelidir, \u00e7\u00fcnk\u00fc O(n) zaman karma\u015f\u0131kl\u0131\u011f\u0131na ve O(1) uzay karma\u015f\u0131kl\u0131\u011f\u0131na sahiptir.<\/li>\n<li><b>\u00d6zel karakterler i\u00e7eren stringler i\u00e7in nas\u0131l bir \u00e7\u00f6z\u00fcm uygulanabilir?<\/b>  ASCII de\u011ferleri yerine, karakterlerin Unicode de\u011ferlerini kullanarak, daha geni\u015f bir karakter setini destekleyen bir \u00e7\u00f6z\u00fcm geli\u015ftirilebilir.<\/li>\n<li><b>Anagram kontrol\u00fc i\u00e7in farkl\u0131 programlama dillerinde neler yapabilirim?<\/b>  Temel mant\u0131k her dilde ayn\u0131d\u0131r, ancak farkl\u0131 dillerin sa\u011flad\u0131\u011f\u0131 veri yap\u0131lar\u0131 ve fonksiyonlar\u0131 kullan\u0131larak optimize edilebilir. \u00d6rne\u011fin, C++'da <code>std::map<\/code> veya <code>std::unordered_map<\/code> kullan\u0131labilir.<\/li>\n<li><b>Bu algoritman\u0131n zaman ve bellek karma\u015f\u0131kl\u0131\u011f\u0131 nas\u0131l iyile\u015ftirilebilir?<\/b>  Zaman karma\u015f\u0131kl\u0131\u011f\u0131, daha verimli veri yap\u0131lar\u0131 kullanarak veya algoritman\u0131n kendisini optimize ederek iyile\u015ftirilebilir. Bellek karma\u015f\u0131kl\u0131\u011f\u0131 ise, gereksiz veri yap\u0131lar\u0131ndan ka\u00e7\u0131n\u0131larak veya daha az bellek t\u00fcketen veri yap\u0131lar\u0131 se\u00e7ilerek iyile\u015ftirilebilir.  \u00d6rne\u011fin, b\u00fcy\u00fck stringler i\u00e7in, par\u00e7alara ay\u0131rarak i\u015flem yapmak bellek kullan\u0131m\u0131n\u0131 azaltabilir.<\/li>\n<\/ul>\n<p>Yazar: Fatih Soysal<\/p>\n","protected":false},"excerpt":{"rendered":"LeetCode #242: Ge\u00e7erli Anagram Kontrol\u00fc \u0130ki stringin birbirinin anagram\u0131 olup olmad\u0131\u011f\u0131n\u0131 kontrol etmek, programlamada s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan bir problemdir.&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-27828","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 #242: Ge\u00e7erli Anagram Kontrol\u00fc<\/title>\n<meta name=\"description\" content=\"\u0130ki stringin birbirinin anagram\u0131 olup olmad\u0131\u011f\u0131n\u0131 kontrol etmek, programlamada s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan bir problemdir. Bu makalede, LeetCode&#039;un #242 sorusu olan &quot;Ge\u00e7erli Anagram&quot; problemini ele alaca\u011f\u0131z. Farkl\u0131 \u00e7\u00f6z\u00fcm y\u00f6ntemlerini kar\u015f\u0131la\u015ft\u0131rarak, performans analizleri yapaca\u011f\u0131z ve ileri d\u00fczey optimizasyon tekniklerini inceleyece\u011fiz. Bu rehber, yeni ba\u015flayanlardan deneyimli geli\u015ftiricilere kadar herkes i\u00e7in faydal\u0131 bilgiler sunmay\u0131 ama\u00e7lamaktad\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-242-gecerli-anagram-kontrolu\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"LeetCode #242: Ge\u00e7erli Anagram Kontrol\u00fc\" \/>\n<meta property=\"og:description\" content=\"\u0130ki stringin birbirinin anagram\u0131 olup olmad\u0131\u011f\u0131n\u0131 kontrol etmek, programlamada s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan bir problemdir. Bu makalede, LeetCode&#039;un #242 sorusu olan &quot;Ge\u00e7erli Anagram&quot; problemini ele alaca\u011f\u0131z. Farkl\u0131 \u00e7\u00f6z\u00fcm y\u00f6ntemlerini kar\u015f\u0131la\u015ft\u0131rarak, performans analizleri yapaca\u011f\u0131z ve ileri d\u00fczey optimizasyon tekniklerini inceleyece\u011fiz. Bu rehber, yeni ba\u015flayanlardan deneyimli geli\u015ftiricilere kadar herkes i\u00e7in faydal\u0131 bilgiler sunmay\u0131 ama\u00e7lamaktad\u0131r.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/\" \/>\n<meta property=\"og:site_name\" content=\"Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2025-08-19T11:00:23+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=\"6 dakika\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/\"},\"author\":{\"name\":\"Fatih Soysal\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"headline\":\"LeetCode #242: Ge\u00e7erli Anagram Kontrol\u00fc\",\"datePublished\":\"2025-08-19T11:00:23+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/\"},\"wordCount\":1120,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/#respond\"]}],\"copyrightYear\":\"2025\",\"copyrightHolder\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/\",\"name\":\"LeetCode #242: Ge\u00e7erli Anagram Kontrol\u00fc\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\"},\"datePublished\":\"2025-08-19T11:00:23+00:00\",\"description\":\"\u0130ki stringin birbirinin anagram\u0131 olup olmad\u0131\u011f\u0131n\u0131 kontrol etmek, programlamada s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan bir problemdir. Bu makalede, LeetCode'un #242 sorusu olan \\\"Ge\u00e7erli Anagram\\\" problemini ele alaca\u011f\u0131z. Farkl\u0131 \u00e7\u00f6z\u00fcm y\u00f6ntemlerini kar\u015f\u0131la\u015ft\u0131rarak, performans analizleri yapaca\u011f\u0131z ve ileri d\u00fczey optimizasyon tekniklerini inceleyece\u011fiz. Bu rehber, yeni ba\u015flayanlardan deneyimli geli\u015ftiricilere kadar herkes i\u00e7in faydal\u0131 bilgiler sunmay\u0131 ama\u00e7lamaktad\u0131r.\",\"breadcrumb\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Anasayfa\",\"item\":\"https:\/\/fatihsoysal.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"LeetCode #242: Ge\u00e7erli Anagram Kontrol\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 #242: Ge\u00e7erli Anagram Kontrol\u00fc","description":"\u0130ki stringin birbirinin anagram\u0131 olup olmad\u0131\u011f\u0131n\u0131 kontrol etmek, programlamada s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan bir problemdir. Bu makalede, LeetCode'un #242 sorusu olan \"Ge\u00e7erli Anagram\" problemini ele alaca\u011f\u0131z. Farkl\u0131 \u00e7\u00f6z\u00fcm y\u00f6ntemlerini kar\u015f\u0131la\u015ft\u0131rarak, performans analizleri yapaca\u011f\u0131z ve ileri d\u00fczey optimizasyon tekniklerini inceleyece\u011fiz. Bu rehber, yeni ba\u015flayanlardan deneyimli geli\u015ftiricilere kadar herkes i\u00e7in faydal\u0131 bilgiler sunmay\u0131 ama\u00e7lamaktad\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-242-gecerli-anagram-kontrolu\/","og_locale":"tr_TR","og_type":"article","og_title":"LeetCode #242: Ge\u00e7erli Anagram Kontrol\u00fc","og_description":"\u0130ki stringin birbirinin anagram\u0131 olup olmad\u0131\u011f\u0131n\u0131 kontrol etmek, programlamada s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan bir problemdir. Bu makalede, LeetCode'un #242 sorusu olan \"Ge\u00e7erli Anagram\" problemini ele alaca\u011f\u0131z. Farkl\u0131 \u00e7\u00f6z\u00fcm y\u00f6ntemlerini kar\u015f\u0131la\u015ft\u0131rarak, performans analizleri yapaca\u011f\u0131z ve ileri d\u00fczey optimizasyon tekniklerini inceleyece\u011fiz. Bu rehber, yeni ba\u015flayanlardan deneyimli geli\u015ftiricilere kadar herkes i\u00e7in faydal\u0131 bilgiler sunmay\u0131 ama\u00e7lamaktad\u0131r.","og_url":"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/","og_site_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","article_published_time":"2025-08-19T11:00:23+00:00","author":"Fatih Soysal","twitter_card":"summary_large_image","twitter_misc":{"Yazan:":"Fatih Soysal","Tahmini okuma s\u00fcresi":"6 dakika"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/#article","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/"},"author":{"name":"Fatih Soysal","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"headline":"LeetCode #242: Ge\u00e7erli Anagram Kontrol\u00fc","datePublished":"2025-08-19T11:00:23+00:00","mainEntityOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/"},"wordCount":1120,"commentCount":0,"publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/#respond"]}],"copyrightYear":"2025","copyrightHolder":{"@id":"https:\/\/fatihsoysal.com\/blog\/#organization"}},{"@type":"WebPage","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/","url":"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/","name":"LeetCode #242: Ge\u00e7erli Anagram Kontrol\u00fc","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/#website"},"datePublished":"2025-08-19T11:00:23+00:00","description":"\u0130ki stringin birbirinin anagram\u0131 olup olmad\u0131\u011f\u0131n\u0131 kontrol etmek, programlamada s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan bir problemdir. Bu makalede, LeetCode'un #242 sorusu olan \"Ge\u00e7erli Anagram\" problemini ele alaca\u011f\u0131z. Farkl\u0131 \u00e7\u00f6z\u00fcm y\u00f6ntemlerini kar\u015f\u0131la\u015ft\u0131rarak, performans analizleri yapaca\u011f\u0131z ve ileri d\u00fczey optimizasyon tekniklerini inceleyece\u011fiz. Bu rehber, yeni ba\u015flayanlardan deneyimli geli\u015ftiricilere kadar herkes i\u00e7in faydal\u0131 bilgiler sunmay\u0131 ama\u00e7lamaktad\u0131r.","breadcrumb":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-242-gecerli-anagram-kontrolu\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Anasayfa","item":"https:\/\/fatihsoysal.com\/blog\/"},{"@type":"ListItem","position":2,"name":"LeetCode #242: Ge\u00e7erli Anagram Kontrol\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\/27828","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=27828"}],"version-history":[{"count":0,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/27828\/revisions"}],"wp:attachment":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/media?parent=27828"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/categories?post=27828"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/tags?post=27828"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}