day 12

Author: libterty

README.md

@@ -12,3 +12,4 @@
     -   Day 9: [Is Perfect Square](https://github.com/libterty/leetcode-challenge/blob/master/src/may/day-nine/index.ts) :alien:
     -   Day 10: [Find Town Judge](https://github.com/libterty/leetcode-challenge/blob/master/src/may/day-ten/index.ts) :poop:
     -   Day 11: [Flood Fill](https://github.com/libterty/leetcode-challenge/blob/master/src/may/day-eleven/index.ts) :raising_hand:
+    -   Day 12: [Single Element in a Sorted Array](https://github.com/libterty/leetcode-challenge/blob/master/src/may/day-twelve/index.ts) :hear_no_evil:

src/may/day-twelve/index.ts

@@ -0,0 +1,26 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+interface MapObject {
+    [key: string]: number;
+}
+
+export const singleNonDuplicate = function (nums: number[]) {
+    const mapStr: string[] = nums.map((n) => n.toString());
+
+    const map: MapObject = mapStr.reduce((allChar: MapObject, char: string) => {
+        if (char in allChar) {
+            allChar[char]++;
+        } else {
+            allChar[char] = 1;
+        }
+        return allChar;
+    }, {});
+
+    const result: [string, number][] = Object.entries(map).sort((a, b) => a[1] - b[1]);
+    return Number(result[0][0]);
+};
+
+const a = singleNonDuplicate([1, 1, 2, 3, 3, 4, 4, 8, 8]);
+console.log('a', a);