From 16418389f8cd073a477c6c3730e709e71d120227 Mon Sep 17 00:00:00 2001
From: Saheed muhammed <saheedm138@gmail.com>
Date: Sat, 19 Apr 2025 13:58:17 +0530
Subject: [PATCH 1/5] Added solution for Challenge 1

---
 Challenge-1/README.md | 1 +
 1 file changed, 1 insertion(+)
 create mode 100644 Challenge-1/README.md

diff --git a/Challenge-1/README.md b/Challenge-1/README.md
new file mode 100644
index 0000000..f7c9fcc
--- /dev/null
+++ b/Challenge-1/README.md
@@ -0,0 +1 @@
+saheed muhammed

From 32c2677bf6b90aab647e8d51645e73f97a6935d1 Mon Sep 17 00:00:00 2001
From: Saheed muhammed <saheedm138@gmail.com>
Date: Sun, 20 Apr 2025 15:51:13 +0530
Subject: [PATCH 2/5] Added Two sum Challenge 2

---
 Challenge-2/solution.py | 9 +++++++++
 1 file changed, 9 insertions(+)
 create mode 100644 Challenge-2/solution.py

diff --git a/Challenge-2/solution.py b/Challenge-2/solution.py
new file mode 100644
index 0000000..2f72754
--- /dev/null
+++ b/Challenge-2/solution.py
@@ -0,0 +1,9 @@
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        prev_map=dict()
+        for i, num in enumerate(nums):
+            if target - num in prev_map:
+               return[i, prev_map[target-num]]
+            prev_map[num]=i
+       
+        return -1     
\ No newline at end of file

From 6c1587294eb0dcabcbb8cda494e3efbd89101132 Mon Sep 17 00:00:00 2001
From: Saheed muhammed <saheedm138@gmail.com>
Date: Tue, 22 Apr 2025 18:04:28 +0530
Subject: [PATCH 3/5] Best time two buy and sell

---
 Challenge_3/solution.py | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 Challenge_3/solution.py

diff --git a/Challenge_3/solution.py b/Challenge_3/solution.py
new file mode 100644
index 0000000..da69616
--- /dev/null
+++ b/Challenge_3/solution.py
@@ -0,0 +1,16 @@
+class Solution:
+    def maxProfit(self, prices: List[int]) -> int:
+        # tow pointer
+        left, right = 0, 1
+        profit = 0
+
+        while right < len(prices):
+        # Check if profitable
+            if prices[right] > prices[left]:
+                profit = max(profit, prices[right] - prices[left])
+            else:
+                left = right  # Update left pointer to the current right 
+
+            right += 1  # Move the right pointer forward
+
+        return profit
\ No newline at end of file

From adbdfa0f473df6c4ee11a117915b23b36ef01488 Mon Sep 17 00:00:00 2001
From: Saheed muhammed <saheedm138@gmail.com>
Date: Tue, 22 Apr 2025 18:15:30 +0530
Subject: [PATCH 4/5] contains Duplicate

---
 Challenge-4/Duplicate.py | 9 +++++++++
 1 file changed, 9 insertions(+)
 create mode 100644 Challenge-4/Duplicate.py

diff --git a/Challenge-4/Duplicate.py b/Challenge-4/Duplicate.py
new file mode 100644
index 0000000..c99aed3
--- /dev/null
+++ b/Challenge-4/Duplicate.py
@@ -0,0 +1,9 @@
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        hash_set=set()
+
+        for num in nums:
+            if num in hash_set:
+                return True
+            hash_set.add(num)
+        return False

From 319b31684a25c3d8364884b4c56ae4f773d64698 Mon Sep 17 00:00:00 2001
From: Saheed muhammed <saheedm138@gmail.com>
Date: Wed, 23 Apr 2025 21:07:52 +0530
Subject: [PATCH 5/5] Added sum of Two Number

---
 Challenge-5/solution.js | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 Challenge-5/solution.js

diff --git a/Challenge-5/solution.js b/Challenge-5/solution.js
new file mode 100644
index 0000000..b1f843f
--- /dev/null
+++ b/Challenge-5/solution.js
@@ -0,0 +1,16 @@
+/**
+ * @param {number} a
+ * @param {number} b
+ * @return {number}
+ */
+var getSum = function(a, b) {
+   
+    while(b){
+      let temp=a
+      a=temp^b
+      b=(temp&b)<<1 
+    }
+    return a
+ 
+    
+};
\ No newline at end of file