Add solution #2396

Author: JoshCrozier

README.md

@@ -309,6 +309,7 @@
 2154|[Keep Multiplying Found Values by Two](./2154-keep-multiplying-found-values-by-two.js)|Easy|
 2235|[Add Two Integers](./2235-add-two-integers.js)|Easy|
 2244|[Minimum Rounds to Complete All Tasks](./2244-minimum-rounds-to-complete-all-tasks.js)|Medium|
+2396|[Strictly Palindromic Number](./2396-strictly-palindromic-number.js)|Medium|
 2427|[Number of Common Factors](./2427-number-of-common-factors.js)|Easy|
 2469|[Convert the Temperature](./2469-convert-the-temperature.js)|Easy|
 2482|[Difference Between Ones and Zeros in Row and Column](./2482-difference-between-ones-and-zeros-in-row-and-column.js)|Medium|

solutions/2396-strictly-palindromic-number.js

@@ -0,0 +1,20 @@
+/**
+ * 2396. Strictly Palindromic Number
+ * https://leetcode.com/problems/strictly-palindromic-number/
+ * Difficulty: Medium
+ *
+ * An integer n is strictly palindromic if, for every base b between 2 and n - 2 (inclusive),
+ * the string representation of the integer n in base b is palindromic.
+ *
+ * Given an integer n, return true if n is strictly palindromic and false otherwise.
+ *
+ * A string is palindromic if it reads the same forward and backward.
+ */
+
+/**
+ * @param {number} n
+ * @return {boolean}
+ */
+var isStrictlyPalindromic = function(n) {
+  return false;
+};