From af653e61ed00d80e87d2da9c43952795792f00a7 Mon Sep 17 00:00:00 2001
From: Jeongan Lee <84510455+fkdl0048@users.noreply.github.com>
Date: Tue, 15 Oct 2024 16:12:03 +0900
Subject: [PATCH] Delete leetcode directory

---
 .../determine_if_two_strings_are_close.cpp    | 30 --------------
 leetcode/dota2_senate.cpp                     | 41 -------------------
 2 files changed, 71 deletions(-)
 delete mode 100644 leetcode/determine_if_two_strings_are_close.cpp
 delete mode 100644 leetcode/dota2_senate.cpp

diff --git a/leetcode/determine_if_two_strings_are_close.cpp b/leetcode/determine_if_two_strings_are_close.cpp
deleted file mode 100644
index 45ef47c..0000000
--- a/leetcode/determine_if_two_strings_are_close.cpp
+++ /dev/null
@@ -1,30 +0,0 @@
-class Solution {
-public:
-    bool closeStrings(string word1, string word2) {
-        if (word1.size() != word2.size()) {
-            return false;
-        }
-
-        vector<int> freq1(26, 0), freq2(26, 0);
-        vector<int> exists1(26, 0), exists2(26, 0);
-
-        for (char c : word1) {
-            freq1[c - 'a']++;
-            exists1[c - 'a'] = 1;
-        }
-
-        for (char c : word2) {
-            freq2[c - 'a']++;
-            exists2[c - 'a'] = 1;
-        }
-
-        if (exists1 != exists2) {
-            return false;
-        }
-
-        sort(freq1.begin(), freq1.end());
-        sort(freq2.begin(), freq2.end());
-
-        return freq1 == freq2;
-    }
-};
diff --git a/leetcode/dota2_senate.cpp b/leetcode/dota2_senate.cpp
deleted file mode 100644
index 680123d..0000000
--- a/leetcode/dota2_senate.cpp
+++ /dev/null
@@ -1,41 +0,0 @@
-#include <queue>
-#include <string>
-
-using namespace std;
-
-class Solution {
-public:
-    string predictPartyVictory(string senate) {
-        queue<int> queueR, queueD;
-        int n = senate.size();
-
-        // Radiant와 Dire 상원의원의 인덱스를 각각의 큐에 저장
-        for (int i = 0; i < n; i++) {
-            if (senate[i] == 'R') {
-                queueR.push(i);
-            } else {
-                queueD.push(i);
-            }
-        }
-
-        // 두 큐가 비어있지 않으면 계속 투표
-        while (!queueR.empty() && !queueD.empty()) {
-            int r_index = queueR.front();
-            int d_index = queueD.front();
-            queueR.pop();
-            queueD.pop();
-
-            // 더 작은 인덱스의 상원의원이 상대방을 추방하고, 다음 투표를 준비
-            if (r_index < d_index) {
-                // Radiant 상원의원이 이겼으므로, 다시 투표 가능
-                queueR.push(r_index + n);
-            } else {
-                // Dire 상원의원이 이겼으므로, 다시 투표 가능
-                queueD.push(d_index + n);
-            }
-        }
-
-        // Radiant 상원의원이 남아 있으면 Radiant 승리, 아니면 Dire 승리
-        return queueR.empty() ? "Dire" : "Radiant";
-    }
-};