From 34599801563f40ba70f580bcf4c01ff5e49867c3 Mon Sep 17 00:00:00 2001
From: YuCheng Hu <huyuchengus@gmail.com>
Date: Tue, 27 Apr 2021 10:29:49 -0400
Subject: [PATCH 1/2] Change the link for the question and solution

---
 .../tests/leetcode/LeetCode0387FirstUniqueCharacterTest.java    | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/toolkits/codebank/src/test/java/com/ossez/toolkits/codebank/tests/leetcode/LeetCode0387FirstUniqueCharacterTest.java b/toolkits/codebank/src/test/java/com/ossez/toolkits/codebank/tests/leetcode/LeetCode0387FirstUniqueCharacterTest.java
index 77ad13d12f..e5b08317b1 100644
--- a/toolkits/codebank/src/test/java/com/ossez/toolkits/codebank/tests/leetcode/LeetCode0387FirstUniqueCharacterTest.java
+++ b/toolkits/codebank/src/test/java/com/ossez/toolkits/codebank/tests/leetcode/LeetCode0387FirstUniqueCharacterTest.java
@@ -14,7 +14,7 @@ import java.util.Map;
  * 7
  * <ul>
  * <li>@see <a href=
- * "https://www.cwiki.us/display/ITCLASSIFICATION/Serialize+and+Deserialize+Binary+Tree">https://www.cwiki.us/display/ITCLASSIFICATION/Serialize+and+Deserialize+Binary+Tree</a>
+ * "https://www.ossez.com/t/first-unique-character-in-a-string/13448">First Unique Character in a String (找到一个字符串中第一个不重复的字符)</a>
  * <li>@see<a href=
  * "https://leetcode.com/problems/first-unique-character-in-a-string/">https://leetcode.com/problems/first-unique-character-in-a-string/</a>
  * </ul>

From ec09d5dfddc30ba1a6d0012c238d3f9a912e031f Mon Sep 17 00:00:00 2001
From: YuCheng Hu <huyuchengus@gmail.com>
Date: Wed, 28 Apr 2021 23:23:48 -0400
Subject: [PATCH 2/2] PrimeNumbers

---
 .../tests/algorithm/PrimeNumbersTest.java     | 61 +++++++++++++++++++
 1 file changed, 61 insertions(+)
 create mode 100644 toolkits/codebank/src/test/java/com/ossez/toolkits/codebank/tests/algorithm/PrimeNumbersTest.java

diff --git a/toolkits/codebank/src/test/java/com/ossez/toolkits/codebank/tests/algorithm/PrimeNumbersTest.java b/toolkits/codebank/src/test/java/com/ossez/toolkits/codebank/tests/algorithm/PrimeNumbersTest.java
new file mode 100644
index 0000000000..918fb247e1
--- /dev/null
+++ b/toolkits/codebank/src/test/java/com/ossez/toolkits/codebank/tests/algorithm/PrimeNumbersTest.java
@@ -0,0 +1,61 @@
+package com.ossez.toolkits.codebank.tests.algorithm;
+
+
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInstance;
+import org.slf4j.Logger;
+import org.slf4j.LoggerFactory;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/**
+ * <p>
+ * More details about question see link below
+ * <ul>
+ * <li>@see <a href= "https://www.cwiki.us/display/ITCLASSIFICATION/Binary+Gap">https://www.cwiki.us/display/ITCLASSIFICATION/Binary+Gap</a>
+ * </li>
+ * </ul>
+ * </p>
+ *
+ * @author YuCheng
+ */
+@TestInstance(TestInstance.Lifecycle.PER_CLASS)
+public class PrimeNumbersTest {
+
+    private final static Logger logger = LoggerFactory.getLogger(PrimeNumbersTest.class);
+
+    /**
+     *
+     */
+    @Test
+    public void testMain() {
+        logger.debug("BEGIN");
+
+        int N = 100;
+        List<Integer> primeNumberList = new ArrayList<>();
+        for (int i = 2; i < N; i++) {
+			if (isPrimeNumber(i))
+				primeNumberList.add(i);
+		}
+
+        logger.debug("primeNumber Count -[{}]", primeNumberList.size());
+		logger.debug("primeNumber Count -[{}]", primeNumberList);
+    }
+
+    /**
+     * @param number
+     * @return
+     */
+    public boolean isPrimeNumber(int number) {
+    	System.out.println(5%3);;
+        for (int i = 2; i < number; i++) {
+            if (number % i == 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+}
+