From ee9e359044c2d00e2b24027c57d9ee2140f92a87 Mon Sep 17 00:00:00 2001 From: thimira nirmal Date: Wed, 20 Oct 2021 22:24:54 +0530 Subject: [PATCH 1/2] Anagram CPP --- String Algorithms/Anagram/Anagram.cpp | 29 +++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 String Algorithms/Anagram/Anagram.cpp diff --git a/String Algorithms/Anagram/Anagram.cpp b/String Algorithms/Anagram/Anagram.cpp new file mode 100644 index 0000000..94f500f --- /dev/null +++ b/String Algorithms/Anagram/Anagram.cpp @@ -0,0 +1,29 @@ +#include +#include + +using namespace std; + +bool Anagram (string str1, string str2){ + int n1 = str1.length(); + int n2 = str2.length(); + + if (n1 != n2) return false; + + sort(str1.begin(), str1.end()); + sort(str2.begin(), str2.end()); + + for (int i = 0; i < n1; i++) + if (str1[i] != str2[i]) + return false; + return true; +} + +int main() { + string str1 = "listen"; + string str2 = "silent"; + + // Note that each letter need to be in same case. Otherwise, use toUpper Function before adding to function. + + cout << (Anagram(str1, str2) ? "Anagram" : "Not Anagram"); + +} \ No newline at end of file From 3f7d01225be7dda2b358e1e0dc44ae6cbb175612 Mon Sep 17 00:00:00 2001 From: thimira nirmal Date: Wed, 20 Oct 2021 22:36:38 +0530 Subject: [PATCH 2/2] Anagram Py --- String Algorithms/Anagram/Anagram.py | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 String Algorithms/Anagram/Anagram.py diff --git a/String Algorithms/Anagram/Anagram.py b/String Algorithms/Anagram/Anagram.py new file mode 100644 index 0000000..f7a9dc1 --- /dev/null +++ b/String Algorithms/Anagram/Anagram.py @@ -0,0 +1,24 @@ +def anagram(str1, str2): + n1 = len(str1) + n2 = len(str2) + + if n1 != n2: + return 0 + + str1 = sorted(str1) + str2 = sorted(str2) + + for i in range(0, n1): + if str1[i] != str2[i]: + return 0 + return 1 + + +# Driver code +str1 = "listen" +str2 = "silent" + +if anagram(str1, str2): + print("Anagram") +else: + print("Not Anagram")