From 5bb073943dbe1cc1ae062f5077b3623426cc3eb4 Mon Sep 17 00:00:00 2001
From: Deven <63876261+devenperez@users.noreply.github.com>
Date: Sun, 12 Feb 2023 22:52:34 -0500
Subject: [PATCH] Create README - LeetHub

---
 202-happy-number/README.md | 37 +++++++++++++++++++++++++++++++++++++
 1 file changed, 37 insertions(+)
 create mode 100644 202-happy-number/README.md

diff --git a/202-happy-number/README.md b/202-happy-number/README.md
new file mode 100644
index 0000000..ae75134
--- /dev/null
+++ b/202-happy-number/README.md
@@ -0,0 +1,37 @@
+<h2><a href="https://leetcode.com/problems/happy-number/">202. Happy Number</a></h2><h3>Easy</h3><hr><div><p>Write an algorithm to determine if a number <code>n</code> is happy.</p>
+
+<p>A <strong>happy number</strong> is a number defined by the following process:</p>
+
+<ul>
+	<li>Starting with any positive integer, replace the number by the sum of the squares of its digits.</li>
+	<li>Repeat the process until the number equals 1 (where it will stay), or it <strong>loops endlessly in a cycle</strong> which does not include 1.</li>
+	<li>Those numbers for which this process <strong>ends in 1</strong> are happy.</li>
+</ul>
+
+<p>Return <code>true</code> <em>if</em> <code>n</code> <em>is a happy number, and</em> <code>false</code> <em>if not</em>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre><strong>Input:</strong> n = 19
+<strong>Output:</strong> true
+<strong>Explanation:</strong>
+1<sup>2</sup> + 9<sup>2</sup> = 82
+8<sup>2</sup> + 2<sup>2</sup> = 68
+6<sup>2</sup> + 8<sup>2</sup> = 100
+1<sup>2</sup> + 0<sup>2</sup> + 0<sup>2</sup> = 1
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre><strong>Input:</strong> n = 2
+<strong>Output:</strong> false
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n &lt;= 2<sup>31</sup> - 1</code></li>
+</ul>
+</div>
\ No newline at end of file