diff --git a/contains-duplicate/suhacs.js b/contains-duplicate/suhacs.js
index f018c8820..62730a360 100644
--- a/contains-duplicate/suhacs.js
+++ b/contains-duplicate/suhacs.js
@@ -3,5 +3,8 @@ function containsDuplicate(nums) {
   const numLength = nums.length;
   return numLength === setLength ? false : true;
 }
-console.log(containsDuplicate([1, 1, 1, 3, 3, 4, 3, 2, 4, 2]));
-//
+//New function after feedback
+
+function containDuplicate2(nums) {
+  return nums.length !== new Set(nums).size;
+}
diff --git a/top-k-frequent-elements/suhacs.js b/top-k-frequent-elements/suhacs.js
index 13bf4d287..fb2a950be 100644
--- a/top-k-frequent-elements/suhacs.js
+++ b/top-k-frequent-elements/suhacs.js
@@ -8,7 +8,13 @@ function top_k_frequent_element(numArr, k) {
     element_qty.push({ [num]: count });
   }
   Object.keys(element_qty).forEach((key) => element_qty[key]);
-}
 
-const Arr = [1, 2, 3, 4, 5, 5, 5, 5, 3, 3, 32, 2, 2, 1];
-top_k_frequent_element(Arr);
+  const sortedArray = element_qty.sort((a, b) => {
+    const valueA = Object.values(a)[0];
+    const valueB = Object.values(b)[0];
+    return valueB - valueA;
+  });
+
+  const topKeys = sortedArray.slice(0, k).map((obj) => Object.keys(obj)[0]);
+  return topKeys;
+}
diff --git a/valid-anagram/suhacs.js b/valid-anagram/suhacs.js
new file mode 100644
index 000000000..89d7719f5
--- /dev/null
+++ b/valid-anagram/suhacs.js
@@ -0,0 +1,7 @@
+function isValidAnagram(s, t) {
+  let temp = t;
+  for (char of s) {
+    temp = temp.replace(char, "");
+  }
+  return temp === "";
+}