day 8

Author: sachuverma

Leetcode Daily Challenge/May-2021/08. Super Palindromes.cpp

@@ -0,0 +1,83 @@
+/*
+Super Palindromes
+=================
+
+Let's say a positive integer is a super-palindrome if it is a palindrome, and it is also the square of a palindrome.
+
+Given two positive integers left and right represented as strings, return the number of super-palindromes integers in the inclusive range [left, right].
+
+Example 1:
+Input: left = "4", right = "1000"
+Output: 4
+Explanation: 4, 9, 121, and 484 are superpalindromes.
+Note that 676 is not a superpalindrome: 26 * 26 = 676, but 26 is not a palindrome.
+
+Example 2:
+Input: left = "1", right = "2"
+Output: 1
+
+Constraints:
+1 <= left.length, right.length <= 18
+left and right consist of only digits.
+left and right cannot have leading zeros.
+left and right represent integers in the range [1, 1018].
+left is less than or equal to right.
+*/
+
+class Solution
+{
+public:
+  bool isPalendrome(long long &n)
+  {
+    string st = to_string(n);
+    int i = 0, j = st.size() - 1;
+    while (i < j)
+    {
+      if (st[i++] != st[j--])
+        return false;
+    }
+    return true;
+  }
+
+  int superpalindromesInRange(string l, string r)
+  {
+    int ans = 0, MAGIC = pow(10, 5);
+    long long left = 0, right = 0;
+    for (auto &i : l)
+      left = left * 10 + (i - '0');
+    for (auto &i : r)
+      right = right * 10 + (i - '0');
+
+    for (int k = 1; k < MAGIC; ++k)
+    {
+      long long R = 0;
+      string S = to_string(k);
+      for (int i = S.size() - 2; i >= 0; --i)
+        S += S[i];
+      for (auto &i : S)
+        R = R * 10 + (i - '0');
+      R = R * R;
+      if (R > right)
+        break;
+      if (R >= left && isPalendrome(R))
+        ans++;
+    }
+
+    for (int k = 1; k < MAGIC; ++k)
+    {
+      long long R = 0;
+      string S = to_string(k);
+      for (int i = S.size() - 1; i >= 0; --i)
+        S += S[i];
+      for (auto &i : S)
+        R = R * 10 + (i - '0');
+      R = R * R;
+      if (R > right)
+        break;
+      if (R >= left && isPalendrome(R))
+        ans++;
+    }
+
+    return ans;
+  }
+};

Leetcode Daily Challenge/May-2021/README.md

@@ -9,3 +9,4 @@
 | 5.  | [Jump Game II](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge-2021/598/week-1-may-1st-may-7th/3732/)                              |                   [cpp](./05.%20Jump%20Game%20II.cpp)                    |
 | 6.  | [Convert Sorted List to Binary Search Tree](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge-2021/598/week-1-may-1st-may-7th/3733/) | [cpp](./06.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree.cpp) |
 | 7.  | [Delete Operation for Two Strings](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge-2021/598/week-1-may-1st-may-7th/3734/)          |       [cpp](./07.%20Delete%20Operation%20for%20Two%20Strings.cpp)        |
+| 8.  | [Super Palindromes](https://leetcode.com/problems/super-palindromes/)          |       [cpp](./08.%20Super%20Palindromes.cpp)        |

Striver Sheet/README.md

@@ -141,6 +141,15 @@
 - [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) - [Cpp Soultion](./Day-15/Longest%20Common%20Prefix.cpp)
 - [Rabin-Karp Algorithm for Pattern Searching](https://www.geeksforgeeks.org/rabin-karp-algorithm-for-pattern-searching/)
 
+### Day 16 ()
+
+- []() - [Cpp Soultion](./Day-16/.cpp)
+- []() - [Cpp Soultion](./Day-16/.cpp)
+- []() - [Cpp Soultion](./Day-16/.cpp)
+- []() - [Cpp Soultion](./Day-16/.cpp)
+- []() - [Cpp Soultion](./Day-16/.cpp)
+- []() - [Cpp Soultion](./Day-16/.cpp)
+
 ###
 
 - []() - [Cpp Soultion](./Day-/.cpp)