leetcode daily 30th Novemver 2022 and others (#2)

Author: arafat-hasan

README.md

@@ -1,17 +1,10 @@
-# ACM 
-ACM type problems solved by me.
-
-<br><br>
-
 **Arafat Hasan Jenin** *<opendoor.arafat[at]gmail[dot]com>*  
-Mawlana Bhashani Science and Technology University  
-Santosh, Tangail  
 *From Rangpur, Bangladesh*
 
 
 <br><br>
 
-#### My IDs in commpetitive programming platforms
+#### My IDs in various problem solving platforms
 Codeforce: [arafat_hasan](http://codeforces.com/profile/arafat_hasan/)  
 Uva: [arafat_hasan](http://uhunt.onlinejudge.org/id/859424/)  
 HackerRank: [arafat_hasan](https://www.hackerrank.com/arafat_hasan/)  

leetcode/AC/Easy/1207.unique_number_of_occurrences.cpp

@@ -0,0 +1,19 @@
+/*
+ * FILE: 1207.unique_number_of_occurrences.cpp
+ * @author: Arafat Hasan Jenin <opendoor.arafat[at]gmail[dot]com>
+ * LINK: https://leetcode.com/problems/unique-number-of-occurrences
+ * DATE CREATED: 30-11-22 11:49:33 (+06)
+ * LAST MODIFIED:
+ * VERDICT: Accepetd
+ */
+
+class Solution {
+ public:
+  bool uniqueOccurrences(vector<int>& arr) {
+    unordered_map<int, int> freq;
+    unordered_set<int> st;
+    for (auto i : arr) freq[i]++;
+    for (auto i : freq) st.insert(i.second);
+    return st.size() == freq.size();
+  }
+};

leetcode/AC/Easy/1323.maximum_69_number.cpp

@@ -0,0 +1,29 @@
+// class Solution {
+// public:
+//  int maximum69Number(int num) {
+//    string str = to_string(num);
+//    for (auto &c : str) {
+//      if (c == '6') {
+//        c = '9';
+//        break;
+//      }
+//    }
+
+//    return stoi(str);
+//  }
+//};
+
+class Solution {
+ public:
+  int maximum69Number(int num) {
+    int p = 1;
+    int n = num, maxp = 0;
+    while (n > 0) {
+      int digit = n % 10;
+      if (digit == 6) maxp = p;
+      p *= 10;
+      n /= 10;
+    }
+    return num + (maxp * 3);
+  }
+};