From 6f959242ffbaee028759b1924565590d07f69b91 Mon Sep 17 00:00:00 2001
From: priyagupta20044 <121642923+priyagupta20044@users.noreply.github.com>
Date: Sat, 27 Jan 2024 13:39:26 +0530
Subject: [PATCH] Create priyagupta20044--c.md

---
 .../priyagupta20044--c.md                     | 30 +++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 Day-17/Q1:Determine if two strings are close/priyagupta20044--c.md

diff --git a/Day-17/Q1:Determine if two strings are close/priyagupta20044--c.md b/Day-17/Q1:Determine if two strings are close/priyagupta20044--c.md
new file mode 100644
index 00000000..2e02aa1b
--- /dev/null
+++ b/Day-17/Q1:Determine if two strings are close/priyagupta20044--c.md	
@@ -0,0 +1,30 @@
+class Solution {
+public:
+    bool closeStrings(string word1, string word2) {
+        if (word1.length()!=word2.length()) return false;
+        map<char,int>m1; 
+        map<char,int>m2; 
+        map<int,int>m3; 
+        map<int,int>m4; 
+
+        for (int i=0;i<word1.length();i++) m1[word1[i]]++;
+        for (int i=0;i<word2.length();i++) m2[word2[i]]++;
+
+        for (auto iter: m1) m3[iter.second]++;
+        for (auto iter: m2) m4[iter.second]++;
+
+        for (auto iter:m1){
+            if (m2.find(iter.first) == m2.end()) return false;
+        }
+        for (auto iter:m3){
+            if (m4.find(iter.first) == m4.end()){
+                return false; 
+            }
+            else{
+                if (iter.second != m4[iter.first])
+                return false;
+            }
+        }
+        return true;
+    }
+};