diff --git a/OJ notes/pages/Leetcode Single-Number.md b/OJ notes/pages/Leetcode Single-Number.md
index e61b1ba..4a04870 100644
--- a/OJ notes/pages/Leetcode Single-Number.md	
+++ b/OJ notes/pages/Leetcode Single-Number.md	
@@ -22,6 +22,7 @@ tag:#bit_manipulation
 
 ##### Links:
 - [Link to problem](https://leetcode.com/problems/single-number/)
+- [Learn about XOR]()
 ___
 ### Problem
 
@@ -31,11 +32,32 @@ You must implement a solution with a linear runtime complexity and use only co
 
 #### Examples
 
+**Example 1:**
+
+**Input:** nums = [2,2,1]
+**Output:** 1
+
+**Example 2:**
+
+**Input:** nums = [4,1,2,1,2]
+**Output:** 4
+
+**Example 3:**
+
+**Input:** nums = [1]
+**Output:** 1
+
 #### Constraints
 
+-   `1 <= nums.length <= 3 * 104`
+-   `-3 * 104 <= nums[i] <= 3 * 104`
+-   Each element in the array appears twice except for one element which appears only once.
+
 ### Thoughts
 
 > [!summary]
-> This is a #template_remove_me
+> This is a #bit_manipulation problem utilizing the XOR operator
+
+
 
 ### Solution