[Jeehay Park(박지혜)] Week 1

contains-duplicate/Jeehay28.js

@@ -0,0 +1,7 @@
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+var containsDuplicate = function (nums) {
+  return nums.length !== new Set(nums).size;
+};

top-k-frequent-elements/Jeehay28.js

@@ -0,0 +1,25 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number[]}
+ */
+var topKFrequent = function (nums, k) {
+  let result = [];
+
+  const obj = nums.reduce((acc, cur) => {
+    acc[cur] = (acc[cur] || 0) + 1;
+    return acc;
+  }, {});
+
+  const frequentValues = Object.values(obj)
+    .sort((a, b) => b - a)
+    .slice(0, k);
+
+  for (const [key, value] of Object.entries(obj)) {
+    if (frequentValues.includes(value)) {
+      result.push(parseInt(key));
+    }
+  }
+
+  return result;
+};

valid-palindrome/Jeehay28.js

@@ -0,0 +1,17 @@
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+var isPalindrome = function (s) {
+  const reg = /[a-z0-9]/g;
+  const converted = s.toLowerCase().match(reg);
+
+  if (converted === null) {
+    return true;
+  } else {
+    const forward = converted.join("");
+    const backward = converted.reverse().join("");
+
+    return forward === backward;
+  }
+};