Question 788 has been solved.

Author: pinarkizilarslan

Q-0788 - Rotated Digits/0788.cpp

@@ -0,0 +1,23 @@
+class Solution {
+public:
+    int rotatedDigits(int n) {
+        int count = 0;
+        for (int i = 0; i <= n; i++) {
+            int j = i;
+            bool check = false;
+            while (j > 0) {
+                if (j % 10 == 3 || j % 10 == 4 || j % 10 == 7) {
+                    check = false;
+                    break;
+                }
+                else if (j % 10 == 2 || j % 10 == 5 || j % 10 == 6 || j % 10 == 9) {
+                    check = true;
+                }
+                j = j / 10;
+            }
+            if (check)
+                count++;
+        }
+        return count;
+    }
+};

Q-0788 - Rotated Digits/0788.py

@@ -0,0 +1,19 @@
+class Solution:
+    def rotatedDigits(self, n: int) -> int:
+        count = 0
+        for i in range(0,n+1):
+            j = i
+            check = False
+            while (j > 0):
+                if (j % 10 == 3 or j % 10 == 4 or j % 10 == 7):
+                    check = False 
+                    break                
+                elif (j % 10 == 2 or j % 10 == 5 or j % 10 == 6 or j % 10 == 9) :
+                    check = True
+                    
+                j = int(j / 10) 
+            
+            if (check):
+                count+=1
+        
+        return count