Add solution #367

Author: JoshCrozier

README.md

@@ -127,6 +127,7 @@
 347|[Top K Frequent Elements](./0347-top-k-frequent-elements.js)|Medium|
 349|[Intersection of Two Arrays](./0349-intersection-of-two-arrays.js)|Easy|
 350|[Intersection of Two Arrays II](./0350-intersection-of-two-arrays-ii.js)|Easy|
+367|[Valid Perfect Square](./0367-valid-perfect-square.js)|Easy|
 374|[Guess Number Higher or Lower](./0374-guess-number-higher-or-lower.js)|Medium|
 383|[Ransom Note](./0383-ransom-note.js)|Easy|
 387|[First Unique Character in a String](./0387-first-unique-character-in-a-string.js)|Easy|

solutions/0367-valid-perfect-square.js

@@ -0,0 +1,30 @@
+/**
+ * 367. Valid Perfect Square
+ * https://leetcode.com/problems/valid-perfect-square/
+ * Difficulty: Easy
+ *
+ * Given a positive integer num, return true if num is a perfect square or false otherwise.
+ *
+ * A perfect square is an integer that is the square of an integer. In other words, it is the
+ * product of some integer with itself.
+ *
+ * You must not use any built-in library function, such as sqrt.
+ */
+
+/**
+ * @param {number} num
+ * @return {boolean}
+ */
+var isPerfectSquare = function(num) {
+  let i = 1;
+
+  while (num > 0) {
+    num -= i;
+    i += 2;
+    if (num === 0) {
+      return true;
+    }
+  }
+
+  return false;
+};