{"id":37825,"date":"2026-01-16T12:01:18","date_gmt":"2026-01-16T09:01:18","guid":{"rendered":"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/"},"modified":"2026-01-16T12:01:18","modified_gmt":"2026-01-16T09:01:18","slug":"leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi","status":"publish","type":"post","link":"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/","title":{"rendered":"LeetCode 2975: Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131 Bulma Rehberi"},"content":{"rendered":"

LeetCode 2975: Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131 Bulma Rehberi<\/h2>\n

Merhaba kodlama merakl\u0131lar\u0131! Bug\u00fcn, LeetCode’un 2975 numaral\u0131 problemi olan “Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131” problemini ad\u0131m ad\u0131m inceleyece\u011fiz. Bu problem, ba\u015flang\u0131\u00e7 seviyesindeki programc\u0131lar i\u00e7in hem geometrik d\u00fc\u015f\u00fcnme hem de etkili veri yap\u0131lar\u0131 kullanma becerilerini geli\u015ftirmek ad\u0131na harika bir f\u0131rsat sunuyor. Karma\u015f\u0131k g\u00f6r\u00fcnen bu problemi basit ad\u0131mlara b\u00f6lerek, nas\u0131l \u00e7\u00f6z\u00fcme ula\u015faca\u011f\u0131m\u0131z\u0131 C++, Python ve JavaScript dillerinde kod \u00f6rnekleriyle birlikte ke\u015ffedece\u011fiz.<\/p>\n

Problemi Anlamak: Tarlalar, \u00c7itler ve Kareler<\/h3>\n

Bu problemde, belirli say\u0131da sat\u0131r (n) ve s\u00fctun (m) i\u00e7eren bir tarlam\u0131z var. Bu tarlan\u0131n i\u00e7inde yatay ve dikey \u00e7itler bulunuyor. Bize verilen hFences<\/code> dizisi yatay \u00e7itlerin konumlar\u0131n\u0131, vFences<\/code> dizisi ise dikey \u00e7itlerin konumlar\u0131n\u0131 belirtiyor. Amac\u0131m\u0131z, bu \u00e7itlerden istedi\u011fimiz kadar\u0131n\u0131 kald\u0131rarak, elde edebilece\u011fimiz en b\u00fcy\u00fck kare \u015feklindeki alan\u0131n b\u00fcy\u00fckl\u00fc\u011f\u00fcn\u00fc bulmak. Unutmay\u0131n, kare bir alan\u0131n kenar uzunluklar\u0131 birbirine e\u015fit olmal\u0131d\u0131r.<\/p>\n

Tarlan\u0131n Yap\u0131s\u0131 ve \u00c7itlerin Konumu<\/h4>\n

Problem tan\u0131m\u0131na g\u00f6re, tarlam\u0131z\u0131n n+1<\/code> yatay \u00e7izgisi ve m+1<\/code> dikey \u00e7izgisi vard\u0131r. Yatay \u00e7izgiler y = 0, 1, ..., n+1<\/code> konumlar\u0131nda, dikey \u00e7izgiler ise x = 0, 1, ..., m+1<\/code> konumlar\u0131nda bulunur. hFences<\/code> dizisindeki her r_i<\/code> de\u011feri, y = r_i<\/code> konumunda bir yatay \u00e7it oldu\u011funu, vFences<\/code> dizisindeki her c_j<\/code> de\u011feri ise x = c_j<\/code> konumunda bir dikey \u00e7it oldu\u011funu g\u00f6sterir. Bu \u00e7izgiler, tarlay\u0131 bir \u0131zgara yap\u0131s\u0131na b\u00f6ler.<\/p>\n

Hedefimiz: Maksimum Kare Alan\u0131<\/h4>\n

Bir kare alan olu\u015fturmak i\u00e7in, iki yatay \u00e7izgi ve iki dikey \u00e7izgi se\u00e7memiz gerekir. Bu \u00e7izgiler aras\u0131ndaki mesafeler e\u015fit olmal\u0131d\u0131r. \u00d6rne\u011fin, y1<\/code> ve y2<\/code> yatay \u00e7izgileri ile x1<\/code> ve x2<\/code> dikey \u00e7izgilerini se\u00e7tiysek, |y2 - y1|<\/code> ve |x2 - x1|<\/code> de\u011ferleri birbirine e\u015fit olmal\u0131 ve bu de\u011fer kare alan\u0131m\u0131z\u0131n bir kenar uzunlu\u011funu temsil etmelidir. Bizim g\u00f6revimiz, t\u00fcm olas\u0131 kombinasyonlar aras\u0131ndan en b\u00fcy\u00fck kenar uzunlu\u011funa sahip kareyi bulmak ve alan\u0131n\u0131 d\u00f6nd\u00fcrmektir.<\/p>\n

\u00c7\u00f6z\u00fcme Giden \u0130lk Ad\u0131mlar: S\u0131n\u0131rlar\u0131 ve \u00c7itleri D\u00fczenleme<\/h3>\n

Problemi \u00e7\u00f6zmeye ba\u015flamadan \u00f6nce, elimizdeki veriyi do\u011fru bir \u015fekilde haz\u0131rlamam\u0131z gerekiyor. Bu, problemin kilit noktalar\u0131ndan biridir.<\/p>\n

Gizli \u00c7itler: S\u0131n\u0131rlar\u0131 Dahil Etmek<\/h4>\n

Problem tan\u0131m\u0131nda belirtildi\u011fi gibi, tarlan\u0131n kendisi y = 0<\/code> ve y = n+1<\/code> konumlar\u0131nda yatay s\u0131n\u0131rlara, x = 0<\/code> ve x = m+1<\/code> konumlar\u0131nda dikey s\u0131n\u0131rlara sahiptir. Bu s\u0131n\u0131rlar, t\u0131pk\u0131 di\u011fer \u00e7itler gibi davran\u0131r ve kare alan olu\u015fturmak i\u00e7in kullan\u0131labilir. Dolay\u0131s\u0131yla, hFences<\/code> dizisine 0<\/code> ve n+1<\/code> de\u011ferlerini, vFences<\/code> dizisine ise 0<\/code> ve m+1<\/code> de\u011ferlerini eklememiz \u015fartt\u0131r. Bu “gizli” \u00e7itler, olas\u0131 t\u00fcm kenar uzunluklar\u0131n\u0131 hesaplarken g\u00f6z \u00f6n\u00fcnde bulundurulmal\u0131d\u0131r.<\/p>\n

\u00c7it Konumlar\u0131n\u0131 D\u00fczenleme: S\u0131ralama ve Tekille\u015ftirme<\/h4>\n

S\u0131n\u0131rlar\u0131 ekledikten sonra, hem yatay hem de dikey \u00e7it konumlar\u0131n\u0131 i\u00e7eren dizilerimiz olacakt\u0131r. Bu dizileri i\u015flemeye ba\u015flamadan \u00f6nce iki \u00f6nemli ad\u0131m atmal\u0131y\u0131z:<\/p>\n

    \n
  1. S\u0131ralama:<\/b> \u00c7it konumlar\u0131n\u0131 k\u00fc\u00e7\u00fckten b\u00fcy\u00fc\u011fe do\u011fru s\u0131ralamak, aralar\u0131ndaki mesafeleri daha kolay ve sistematik bir \u015fekilde hesaplamam\u0131z\u0131 sa\u011flar.<\/li>\n
  2. Tekille\u015ftirme:<\/b> Ayn\u0131 konumda birden fazla \u00e7it olmas\u0131 durumu, problemde bir farkl\u0131l\u0131k yaratmaz. Bu y\u00fczden, her \u00e7it konumunun sadece bir kez listede yer almas\u0131n\u0131 sa\u011flamak i\u00e7in dizileri tekille\u015ftirmeliyiz.<\/li>\n<\/ol>\n

    Bu ad\u0131mlar, hem do\u011fru sonu\u00e7lar elde etmemizi hem de gereksiz hesaplamalardan ka\u00e7\u0131narak performans\u0131m\u0131z\u0131 art\u0131rmam\u0131z\u0131 sa\u011flar.<\/p>\n

    Olas\u0131 Mesafeleri Bulma: Yatay ve Dikey Geni\u015flikler<\/h3>\n

    \u00c7it konumlar\u0131n\u0131 d\u00fczenledikten sonra, bir sonraki ad\u0131m, bu \u00e7itler aras\u0131nda olu\u015fabilecek t\u00fcm olas\u0131 yatay ve dikey mesafeleri (yani karelerin potansiyel kenar uzunluklar\u0131n\u0131) bulmakt\u0131r.<\/p>\n

    Yatay Mesafelerin Hesaplanmas\u0131<\/h4>\n

    D\u00fczenlenmi\u015f hFences<\/code> dizisini ele alal\u0131m. Bu dizideki her iki \u00e7it konumu (f1<\/code> ve f2<\/code>) aras\u0131nda bir mesafe (f2 - f1<\/code>) hesaplayabiliriz. Bu mesafeler, yatay bir kenar uzunlu\u011fu olmaya adayd\u0131r. T\u00fcm olas\u0131 yatay mesafeleri bir k\u00fcme (set) veri yap\u0131s\u0131nda saklamak, daha sonra dikey mesafelerle kar\u015f\u0131la\u015ft\u0131rmam\u0131z\u0131 kolayla\u015ft\u0131racakt\u0131r.<\/p>\n

    Dikey Mesafelerin Hesaplanmas\u0131<\/h4>\n

    Ayn\u0131 mant\u0131kla, d\u00fczenlenmi\u015f vFences<\/code> dizisindeki her iki \u00e7it konumu (f1<\/code> ve f2<\/code>) aras\u0131ndaki mesafeyi (f2 - f1<\/code>) hesaplar\u0131z. Bu mesafeler de dikey bir kenar uzunlu\u011fu olmaya adayd\u0131r. Bu dikey mesafeleri de ayr\u0131 bir k\u00fcme veri yap\u0131s\u0131nda saklar\u0131z.<\/p>\n

    Veri Yap\u0131s\u0131 Se\u00e7imi: Setler (K\u00fcmeler)<\/h4>\n

    Neden k\u00fcme (set) kullan\u0131yoruz? \u00c7\u00fcnk\u00fc k\u00fcmeler, elemanlar\u0131 otomatik olarak tekille\u015ftirir ve eleman arama i\u015flemlerini \u00e7ok h\u0131zl\u0131 bir \u015fekilde ger\u00e7ekle\u015ftirir. Bu, \u00f6zellikle ortak mesafeleri bulma a\u015famas\u0131nda bize b\u00fcy\u00fck avantaj sa\u011flar.<\/p>\n

    Ortak Mesafeleri Belirleme ve Maksimum Kare Alan\u0131<\/h3>\n

    Art\u0131k elimizde t\u00fcm olas\u0131 yatay ve dikey kenar uzunluklar\u0131n\u0131 i\u00e7eren iki ayr\u0131 k\u00fcme var. Bir kare olu\u015fturmak i\u00e7in hem yatay hem de dikey kenar uzunlu\u011funun ayn\u0131 olmas\u0131 gerekir. Bu y\u00fczden, iki k\u00fcmenin kesi\u015fimini bulmal\u0131y\u0131z.<\/p>\n

    Ortak Mesafelerin Kesi\u015fimi<\/h4>\n

    Yatay mesafeler k\u00fcmesi (h_distances<\/code>) ve dikey mesafeler k\u00fcmesi (v_distances<\/code>) aras\u0131ndaki kesi\u015fimi buldu\u011fumuzda, elimizde hem yatayda hem de dikeyde olu\u015fturulabilecek t\u00fcm olas\u0131 kare kenar uzunluklar\u0131 kal\u0131r. Bu ortak mesafelerden en b\u00fcy\u00fc\u011f\u00fcn\u00fc bulmak, bizim i\u00e7in kritik \u00f6neme sahiptir.<\/p>\n

    Maksimum Ortak Mesafeyi Bulma<\/h4>\n

    Kesi\u015fim k\u00fcmesindeki t\u00fcm elemanlar aras\u0131ndan en b\u00fcy\u00fck de\u011feri se\u00e7meliyiz. Bu de\u011fer, olu\u015fturabilece\u011fimiz en b\u00fcy\u00fck karenin bir kenar uzunlu\u011funu temsil eder. E\u011fer kesi\u015fim k\u00fcmesi bo\u015fsa (yani hi\u00e7bir ortak mesafe yoksa), bu durumda kare alan olu\u015fturmak m\u00fcmk\u00fcn de\u011fildir ve problem gere\u011fi 0<\/code> d\u00f6nd\u00fcr\u00fclmelidir.<\/p>\n

    Alan Hesaplamas\u0131 ve Modulo \u0130\u015flemi<\/h4>\n

    En b\u00fcy\u00fck ortak kenar uzunlu\u011funu (side<\/code>) bulduktan sonra, maksimum kare alan\u0131 side * side<\/code> olarak hesaplan\u0131r. Ancak, problem genellikle b\u00fcy\u00fck say\u0131larla \u00e7al\u0131\u015f\u0131rken sonu\u00e7lar\u0131n belirli bir mod\u00fcloya g\u00f6re d\u00f6nd\u00fcr\u00fclmesini ister. Bu problemde de 10^9 + 7<\/code> mod\u00fclosu kullanmam\u0131z isteniyor. Bu, sonucun belirli bir aral\u0131kta kalmas\u0131n\u0131 sa\u011flar ve ta\u015fma problemlerini \u00f6nler.<\/p>\n

    Algoritma ve Kod \u00d6rnekleri<\/h3>\n

    \u015eimdiye kadar bahsetti\u011fimiz ad\u0131mlar\u0131 bir algoritma olarak \u00f6zetleyelim ve ard\u0131ndan C++, Python ve JavaScript dillerinde \u00f6rnek uygulamalar\u0131n\u0131 g\u00f6relim.<\/p>\n

      \n
    1. hFences<\/code> ve vFences<\/code> dizilerine tarlan\u0131n s\u0131n\u0131rlar\u0131n\u0131 (0 ve n+1\/m+1) ekleyin.<\/li>\n
    2. Her iki diziyi s\u0131ralay\u0131n ve tekille\u015ftirin.<\/li>\n
    3. Her iki dizideki t\u00fcm \u00e7it \u00e7iftleri aras\u0131ndaki mesafeleri hesaplayarak ayr\u0131 ayr\u0131 k\u00fcmelere (h_distances<\/code>, v_distances<\/code>) ekleyin.<\/li>\n
    4. h_distances<\/code> ve v_distances<\/code> k\u00fcmelerinin kesi\u015fimini bulun.<\/li>\n
    5. Kesi\u015fim k\u00fcmesindeki en b\u00fcy\u00fck de\u011feri (max_side<\/code>) bulun. E\u011fer k\u00fcme bo\u015fsa, 0<\/code> d\u00f6nd\u00fcr\u00fcn.<\/li>\n
    6. Sonucu (max_side * max_side) % (10^9 + 7)<\/code> olarak hesaplay\u0131p d\u00f6nd\u00fcr\u00fcn.<\/li>\n<\/ol>\n

      C++ \u00c7\u00f6z\u00fcm\u00fc<\/h4>\n
      \n#include \n#include \n#include \n\nclass Solution {\npublic:\n    int maximizeSquareArea(int n, int m, std::vector& hFences, std::vector& vFences) {\n        long long MOD = 1e9 + 7;\n\n        \/\/ 1. S\u0131n\u0131rlar\u0131 ekle\n        hFences.push_back(0);\n        hFences.push_back(n + 1);\n        vFences.push_back(0);\n        vFences.push_back(m + 1);\n\n        \/\/ 2. S\u0131rala ve tekille\u015ftir\n        std::sort(hFences.begin(), hFences.end());\n        hFences.erase(std::unique(hFences.begin(), hFences.end()), hFences.end());\n\n        std::sort(vFences.begin(), vFences.end());\n        vFences.erase(std::unique(vFences.begin(), vFences.end()), vFences.end());\n\n        \/\/ 3. Olas\u0131 yatay ve dikey mesafeleri hesapla\n        std::set h_distances;\n        for (size_t i = 0; i < hFences.size(); ++i) {\n            for (size_t j = i + 1; j < hFences.size(); ++j) {\n                h_distances.insert(hFences[j] - hFences[i]);\n            }\n        }\n\n        std::set v_distances;\n        for (size_t i = 0; i < vFences.size(); ++i) {\n            for (size_t j = i + 1; j < vFences.size(); ++j) {\n                v_distances.insert(vFences[j] - vFences[i]);\n            }\n        }\n\n        \/\/ 4. Ortak mesafeleri bul ve en b\u00fcy\u00fc\u011f\u00fcn\u00fc se\u00e7\n        long long max_side = 0;\n        for (int dist : h_distances) {\n            if (v_distances.count(dist)) { \/\/ dist hem yatay hem dikeyde var m\u0131?\n                max_side = std::max(max_side, (long long)dist);\n            }\n        }\n\n        \/\/ 5. Sonucu hesapla\n        if (max_side == 0) {\n            return -1; \/\/ Hi\u00e7bir kare olu\u015fturulamazsa -1 d\u00f6nd\u00fcr\u00fcl\u00fcyor (LeetCode problemine g\u00f6re)\n        }\n        return (max_side * max_side) % MOD;\n    }\n};\n<\/pre>\n
      <\/code><\/p>\n
      C++ \u00e7\u00f6z\u00fcm\u00fcnde, std::vector<\/code> ve std::set<\/code> gibi STL kapsay\u0131c\u0131lar\u0131 kullan\u0131yoruz. std::sort<\/code> ve std::unique<\/code> fonksiyonlar\u0131 dizileri d\u00fczenlemek i\u00e7in idealdir. Modulo i\u015flemi i\u00e7in long long<\/code> kullanmak, olas\u0131 ta\u015fmalar\u0131 engeller.<\/p>\n
      Python \u00c7\u00f6z\u00fcm\u00fc<\/h4>\n
      \nclass Solution:\n    def maximizeSquareArea(self, n: int, m: int, hFences: list[int], vFences: list[int]) -> int:\n        MOD = 10**9 + 7\n\n        # 1. S\u0131n\u0131rlar\u0131 ekle\n        hFences.append(0)\n        hFences.append(n + 1)\n        vFences.append(0)\n        vFences.append(m + 1)\n\n        # 2. S\u0131rala ve tekille\u015ftir\n        hFences = sorted(list(set(hFences)))\n        vFences = sorted(list(set(vFences)))\n\n        # 3. Olas\u0131 yatay ve dikey mesafeleri hesapla\n        h_distances = set()\n        for i in range(len(hFences)):\n            for j in range(i + 1, len(hFences)):\n                h_distances.add(hFences[j] - hFences[i])\n\n        v_distances = set()\n        for i in range(len(vFences)):\n            for j in range(i + 1, len(vFences)):\n                v_distances.add(vFences[j] - vFences[i])\n\n        # 4. Ortak mesafeleri bul ve en b\u00fcy\u00fc\u011f\u00fcn\u00fc se\u00e7\n        max_side = 0\n        for dist in h_distances:\n            if dist in v_distances:\n                max_side = max(max_side, dist)\n        \n        # 5. Sonucu hesapla\n        if max_side == 0:\n            return -1 # Hi\u00e7bir kare olu\u015fturulamazsa -1 d\u00f6nd\u00fcr\u00fcl\u00fcyor (LeetCode problemine g\u00f6re)\n        \n        return (max_side * max_side) % MOD\n<\/pre>\n
      <\/code><\/p>\n
      Python'da set()<\/code> veri yap\u0131s\u0131 tekille\u015ftirme ve h\u0131zl\u0131 arama i\u00e7in do\u011fal bir se\u00e7imdir. sorted(list(set(...)))<\/code> ifadesi hem tekille\u015ftirme hem de s\u0131ralama i\u015flemini pratik bir \u015fekilde yapar.<\/p>\n
      JavaScript \u00c7\u00f6z\u00fcm\u00fc<\/h4>\n
      \n\/**\n * @param {number} n\n * @param {number} m\n * @param {number[]} hFences\n * @param {number[]} vFences\n * @return {number}\n *\/\nvar maximizeSquareArea = function(n, m, hFences, vFences) {\n    const MOD = 10**9 + 7;\n\n    \/\/ 1. S\u0131n\u0131rlar\u0131 ekle\n    hFences.push(0, n + 1);\n    vFences.push(0, m + 1);\n\n    \/\/ 2. S\u0131rala ve tekille\u015ftir\n    hFences = [...new Set(hFences)].sort((a, b) => a - b);\n    vFences = [...new Set(vFences)].sort((a, b) => a - b);\n\n    \/\/ 3. Olas\u0131 yatay ve dikey mesafeleri hesapla\n    const hDistances = new Set();\n    for (let i = 0; i < hFences.length; i++) {\n        for (let j = i + 1; j < hFences.length; j++) {\n            hDistances.add(hFences[j] - hFences[i]);\n        }\n    }\n\n    const vDistances = new Set();\n    for (let i = 0; i < vFences.length; i++) {\n        for (let j = i + 1; j < vFences.length; j++) {\n            vDistances.add(vFences[j] - vFences[i]);\n        }\n    }\n\n    \/\/ 4. Ortak mesafeleri bul ve en b\u00fcy\u00fc\u011f\u00fcn\u00fc se\u00e7\n    let maxSide = 0;\n    for (const dist of hDistances) {\n        if (vDistances.has(dist)) {\n            maxSide = Math.max(maxSide, dist);\n        }\n    }\n\n    \/\/ 5. Sonucu hesapla\n    if (maxSide === 0) {\n        return -1; \/\/ Hi\u00e7bir kare olu\u015fturulamazsa -1 d\u00f6nd\u00fcr\u00fcl\u00fcyor (LeetCode problemine g\u00f6re)\n    }\n\n    \/\/ JavaScript'te b\u00fcy\u00fck say\u0131lar i\u00e7in BigInt kullanmak gerekebilir,\n    \/\/ ancak 10^9 + 7 mod\u00fcl\u00fc sayesinde sonu\u00e7 normal number aral\u0131\u011f\u0131nda kal\u0131r.\n    return (maxSide * maxSide) % MOD;\n};\n<\/pre>\n
      <\/code><\/p>\n
      JavaScript'te Set<\/code> objesi ve spread operat\u00f6r\u00fc (...<\/code>) ile tekille\u015ftirme ve s\u0131ralama i\u015flemleri kolayca yap\u0131labilir. Math.max<\/code> fonksiyonu en b\u00fcy\u00fck de\u011feri bulmak i\u00e7in kullan\u0131l\u0131r.<\/p>\n
      Karma\u015f\u0131kl\u0131k Analizi<\/h3>\n
      Herhangi bir algoritmay\u0131 de\u011ferlendirirken, zaman ve uzay karma\u015f\u0131kl\u0131\u011f\u0131na bakmak \u00f6nemlidir.<\/p>\n
      Zaman Karma\u015f\u0131kl\u0131\u011f\u0131<\/h4>\n
        \n
      • S\u0131n\u0131rlar\u0131 Ekleme:<\/b> O(1)<\/li>\n
      • S\u0131ralama ve Tekille\u015ftirme:<\/b> E\u011fer N_h<\/code> ve N_v<\/code> s\u0131ras\u0131yla yatay ve dikey \u00e7itlerin son say\u0131lar\u0131 ise, s\u0131ralama O(N_h log N_h + N_v log N_v)<\/code> zaman al\u0131r. Tekille\u015ftirme bu karma\u015f\u0131kl\u0131\u011f\u0131 de\u011fi\u015ftirmez. N_h<\/code> en fazla n + 2<\/code> ve N_v<\/code> en fazla m + 2<\/code> olabilir.<\/li>\n
      • Mesafeleri Hesaplama:<\/b> Her iki dizi i\u00e7in de i\u00e7 i\u00e7e d\u00f6ng\u00fcler kulland\u0131\u011f\u0131m\u0131zdan, bu O(N_h^2 + N_v^2)<\/code> zaman al\u0131r. Her bir mesafe k\u00fcmesine ekleme i\u015flemi ortalama O(1)<\/code>'dir.<\/li>\n
      • Ortak Mesafeleri Bulma:<\/b> h_distances<\/code> k\u00fcmesi \u00fczerindeki her eleman i\u00e7in v_distances<\/code> k\u00fcmesinde arama yapar\u0131z. Bu, O(N_h * log(N_v))<\/code> veya ortalama O(N_h)<\/code> zaman al\u0131r (k\u00fcme aramas\u0131n\u0131n ortalama O(1)<\/code> oldu\u011fu varsay\u0131l\u0131rsa).<\/li>\n<\/ul>\n
            Genel olarak, bask\u0131n fakt\u00f6r mesafeleri hesaplama ad\u0131m\u0131d\u0131r: O(N_h^2 + N_v^2)<\/code>.\n<\/p>\n
        Uzay Karma\u015f\u0131kl\u0131\u011f\u0131<\/h4>\n
          \n
        • \u00c7it Dizileri:<\/b> O(N_h + N_v)<\/code><\/li>\n
        • Mesafe K\u00fcmeleri:<\/b> En k\u00f6t\u00fc durumda, h_distances<\/code> k\u00fcmesi O(N_h^2)<\/code> ve v_distances<\/code> k\u00fcmesi O(N_v^2)<\/code> eleman i\u00e7erebilir.<\/li>\n<\/ul>\n
              Genel olarak, bask\u0131n fakt\u00f6r mesafe k\u00fcmeleridir: O(N_h^2 + N_v^2)<\/code>.\n<\/p>\n
          Bu problemde n<\/code> ve m<\/code> de\u011ferleri 100'e kadar \u00e7\u0131kabildi\u011finden, N_h<\/code> ve N_v<\/code> de yakla\u015f\u0131k 100 civar\u0131nda olur. Dolay\u0131s\u0131yla 100^2 = 10000<\/code> i\u015flemi kabul edilebilir bir karma\u015f\u0131kl\u0131ktad\u0131r.<\/p>\n
          Sonu\u00e7<\/h3>\n
          LeetCode 2975 problemi, basit bir geometrik problemi etkili veri yap\u0131lar\u0131 ve algoritmik d\u00fc\u015f\u00fcnceyle nas\u0131l \u00e7\u00f6zebilece\u011fimizi g\u00f6steren g\u00fczel bir \u00f6rnektir. S\u0131n\u0131r ko\u015fullar\u0131n\u0131 do\u011fru bir \u015fekilde ele almak, veriyi d\u00fczenlemek (s\u0131ralama ve tekille\u015ftirme) ve uygun veri yap\u0131lar\u0131n\u0131 (k\u00fcmeler) kullanmak, bu t\u00fcr problemlerin \u00e7\u00f6z\u00fcm\u00fcnde anahtard\u0131r. Maksimum kare alan\u0131 bulma yakla\u015f\u0131m\u0131, di\u011fer benzer \"maksimum dikd\u00f6rtgen\/kare\" problemlerine de uyarlanabilir. Umar\u0131m bu rehber, problemi anlaman\u0131za ve kendi \u00e7\u00f6z\u00fcmlerinizi geli\u015ftirmenize yard\u0131mc\u0131 olmu\u015ftur!<\/p>\n
          S\u0131k\u00e7a Sorulan Sorular (SSS)<\/h3>\n
          Neden 0 ve n+1\/m+1 s\u0131n\u0131rlar\u0131n\u0131 ekliyoruz?<\/h4>\n
          Tarlan\u0131n kendisi, d\u0131\u015f kenarlar\u0131nda da hayali \u00e7itlere sahiptir. Bu s\u0131n\u0131rlar, i\u00e7 \u00e7itler gibi bir kare alan\u0131n kenar\u0131 olarak kullan\u0131labilir. \u00d6rne\u011fin, y=0<\/code> ve y=5<\/code> aras\u0131nda bir yatay kenar olu\u015fturmak isteyebilirsiniz, ancak hFences<\/code> dizisinde 0<\/code> veya 5<\/code> olmasa bile bu kenarlar mevcuttur. Bu s\u0131n\u0131rlar\u0131 dahil etmek, t\u00fcm olas\u0131 kenar uzunluklar\u0131n\u0131 g\u00f6z \u00f6n\u00fcnde bulundurmam\u0131z\u0131 sa\u011flar.<\/p>\n
          Neden set (k\u00fcme) kullan\u0131yoruz? Listelerle olmaz m\u0131yd\u0131?<\/h4>\n
          Listelerle de \u00e7\u00f6z\u00fclebilirdi ancak setler, iki temel avantaj sunar:<\/p>\n
            \n
          1. Tekille\u015ftirme:<\/b> Setler, ayn\u0131 eleman\u0131 birden fazla kez i\u00e7ermez. Bu, \u00e7it konumlar\u0131n\u0131 veya mesafeleri otomatik olarak tekille\u015ftirmemizi sa\u011flar.<\/li>\n
          2. H\u0131zl\u0131 Arama:<\/b> Bir eleman\u0131n sette olup olmad\u0131\u011f\u0131n\u0131 kontrol etmek (.has()<\/code> veya .count()<\/code>) ortalama O(1) zaman al\u0131r. Listelerde bu i\u015flem O(N) zaman al\u0131rd\u0131, bu da \u00f6zellikle ortak mesafeleri bulma ad\u0131m\u0131nda performans\u0131 \u00f6nemli \u00f6l\u00e7\u00fcde etkilerdi.<\/li>\n<\/ol>\n
            Modulo i\u015flemi (10^9 + 7) neden gerekli?<\/h4>\n
            Modulo i\u015flemi, \u00f6zellikle b\u00fcy\u00fck say\u0131larla yap\u0131lan hesaplamalarda sonucun belirli bir aral\u0131kta kalmas\u0131n\u0131 sa\u011flamak i\u00e7in kullan\u0131l\u0131r. Problemde n<\/code> ve m<\/code> de\u011ferleri 100'e kadar \u00e7\u0131kabilir. Bu durumda max_side<\/code> 100'den b\u00fcy\u00fck olabilir (\u00f6rne\u011fin n+1<\/code>). max_side * max_side<\/code> i\u015flemi \u00e7ok b\u00fcy\u00fck bir say\u0131ya d\u00f6n\u00fc\u015febilir ve standart integer tiplerinin kapasitesini a\u015farak ta\u015fma (overflow) hatalar\u0131na yol a\u00e7abilir. Modulo i\u015flemi, sonucun her zaman 0<\/code> ile 10^9 + 6<\/code> aras\u0131nda kalmas\u0131n\u0131 garanti eder.<\/p>\n
            Bu problem t\u00fcr\u00fc ba\u015fka nerede kar\u015f\u0131ma \u00e7\u0131kabilir?<\/h4>\n
            Bu t\u00fcr problemler, genellikle geometrik algoritmalar, \u0131zgara tabanl\u0131 problemler ve kombinatorik optimizasyon problemlerinde kar\u015f\u0131m\u0131za \u00e7\u0131kar. \u00d6rne\u011fin, \"maksimum dikd\u00f6rtgen alan\", \"en yak\u0131n nokta \u00e7ifti\" gibi problemler benzer mant\u0131k ve veri yap\u0131lar\u0131 kullan\u0131larak \u00e7\u00f6z\u00fclebilir. Temel mant\u0131k, t\u00fcm olas\u0131 alt problemleri veya alt yap\u0131lar\u0131 sistematik olarak incelemek ve en iyi \u00e7\u00f6z\u00fcm\u00fc bulmakt\u0131r.<\/p>\n","protected":false},"excerpt":{"rendered":"Merhaba kodlama merakl\u0131lar\u0131! Bug\u00fcn, LeetCode’un 2975 numaral\u0131 problemi olan “Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131” problemini ad\u0131m ad\u0131m i…","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-37825","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-genel","7":"cs-entry","8":"cs-video-wrap"},"yoast_head":"\nLeetCode 2975: Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131 Bulma Rehberi - Kodlar\u0131n Gizemli D\u00fcnyas\u0131<\/title>\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-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"LeetCode 2975: Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131 Bulma Rehberi\" \/>\n<meta property=\"og:description\" content=\"Merhaba kodlama merakl\u0131lar\u0131! Bug\u00fcn, LeetCode'un 2975 numaral\u0131 problemi olan "Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131" problemini ad\u0131m ad\u0131m i...\" \/>\n<meta property=\"og:url\" content=\"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/\" \/>\n<meta property=\"og:site_name\" content=\"Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2026-01-16T09:01:18+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=\"13 dakika\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/\"},\"author\":{\"name\":\"Fatih Soysal\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"headline\":\"LeetCode 2975: Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131 Bulma Rehberi\",\"datePublished\":\"2026-01-16T09:01:18+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/\"},\"wordCount\":1845,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/#respond\"]}],\"copyrightYear\":\"2026\",\"copyrightHolder\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/\",\"name\":\"LeetCode 2975: Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131 Bulma Rehberi - Kodlar\u0131n Gizemli D\u00fcnyas\u0131\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\"},\"datePublished\":\"2026-01-16T09:01:18+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Anasayfa\",\"item\":\"https:\/\/fatihsoysal.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"LeetCode 2975: Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131 Bulma Rehberi\"}]},{\"@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 2975: Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131 Bulma Rehberi - Kodlar\u0131n Gizemli D\u00fcnyas\u0131","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-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/","og_locale":"tr_TR","og_type":"article","og_title":"LeetCode 2975: Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131 Bulma Rehberi","og_description":"Merhaba kodlama merakl\u0131lar\u0131! Bug\u00fcn, LeetCode'un 2975 numaral\u0131 problemi olan \"Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131\" problemini ad\u0131m ad\u0131m i...","og_url":"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/","og_site_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","article_published_time":"2026-01-16T09:01:18+00:00","author":"Fatih Soysal","twitter_card":"summary_large_image","twitter_misc":{"Yazan:":"Fatih Soysal","Tahmini okuma s\u00fcresi":"13 dakika"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/#article","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/"},"author":{"name":"Fatih Soysal","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"headline":"LeetCode 2975: Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131 Bulma Rehberi","datePublished":"2026-01-16T09:01:18+00:00","mainEntityOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/"},"wordCount":1845,"commentCount":0,"publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/#respond"]}],"copyrightYear":"2026","copyrightHolder":{"@id":"https:\/\/fatihsoysal.com\/blog\/#organization"}},{"@type":"WebPage","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/","url":"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/","name":"LeetCode 2975: Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131 Bulma Rehberi - Kodlar\u0131n Gizemli D\u00fcnyas\u0131","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/#website"},"datePublished":"2026-01-16T09:01:18+00:00","breadcrumb":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-2975-tarladan-citleri-kaldirarak-maksimum-kare-alani-bulma-rehberi\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Anasayfa","item":"https:\/\/fatihsoysal.com\/blog\/"},{"@type":"ListItem","position":2,"name":"LeetCode 2975: Tarladan \u00c7itleri Kald\u0131rarak Maksimum Kare Alan\u0131 Bulma Rehberi"}]},{"@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\/37825","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=37825"}],"version-history":[{"count":0,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/37825\/revisions"}],"wp:attachment":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/media?parent=37825"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/categories?post=37825"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/tags?post=37825"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}