diff --git a/Easy/1. Two Sum.js b/Easy/1. Two Sum.js
index 2a05ebe..732da79 100644
--- a/Easy/1. Two Sum.js	
+++ b/Easy/1. Two Sum.js	
@@ -35,16 +35,11 @@ Output: [0,1]
  * @return {number[]}
  */
 var twoSum = function (nums, target) {
-    var s = 0;  //initilize a pointer to 0
-    for (let i = 1; i < nums.length; i++) { //itterate 1 to length
+    return nums.map((s,i)=>{
         if ((nums[s] + nums[i]) == target) {    //check the pointer is equal to the target number or not
             return [s, i];  //return if both sum are equal to the target
         }
-        if (i == nums.length - 1) { //if i equal to the length-1 then reinitilize it's to s+1
-            i = s + 1;
-            s++;
-        }
-    }
+    })
 }
 var nums = [3, 2, 4], target = 6;
-console.log(twoSum(nums, target));
\ No newline at end of file
+console.log(twoSum(nums, target));
diff --git a/Medium/2. Add Two Numbers.js b/Medium/2. Add Two Numbers.js
new file mode 100644
index 0000000..5f11483
--- /dev/null
+++ b/Medium/2. Add Two Numbers.js	
@@ -0,0 +1,54 @@
+/*
+You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.
+
+You may assume the two numbers do not contain any leading zero, except the number 0 itself.
+
+Input: l1 = [2,4,3], l2 = [5,6,4]
+Output: [7,0,8]
+Explanation: 342 + 465 = 807.
+Example 2:
+
+Input: l1 = [0], l2 = [0]
+Output: [0]
+Example 3:
+
+Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
+Output: [8,9,9,9,0,0,0,1]
+
+*/
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+/**
+ * @param {ListNode} l1
+ * @param {ListNode} l2
+ * @return {ListNode}
+ */
+
+var addTwoNumbers = function (l1, l2) {
+  let carry = 0;
+  let dummy = new ListNode(0);
+  let current = dummy;
+  while (l1 || l2) {
+    let sum = carry;
+    if (l1) {
+      sum += l1.val;
+      l1 = l1.next;
+    }
+    if (l2) {
+      sum += l2.val;
+      l2 = l2.next;
+    }
+    carry = Math.floor(sum / 10);
+    current.next = new ListNode(sum % 10);
+    current = current.next;
+  }
+  if (carry > 0) {
+    current.next = new ListNode(carry);
+  }
+  return dummy.next;
+};
diff --git a/README.md b/README.md
index 0585853..189ff2c 100644
--- a/README.md
+++ b/README.md
@@ -1,11 +1,23 @@
-# DSA-leetCode-JavaScript-Solution
+# LeetCode Problem Solutions in JavaScript
+This repository contains my solutions to various LeetCode problems in JavaScript.
 
-If you're interested in contributing to a GitHub repository for LeetCode solutions, there are several ways you can get involved. Contributing to an open source project can be a great way to develop your coding skills, build your portfolio, and collaborate with other developers.
+## Getting Started
+To run the code and test the solutions
+  
+  1. Download Node.js
 
-First, you'll need to find a LeetCode repository on GitHub that is open for contributions. Once you've identified a repository that interests you, take some time to read through the existing code and understand the project's structure.
 
-Next, you can start contributing to the repository by submitting pull requests with your code changes. Before you make any changes, it's a good idea to create a fork of the repository and make your changes in a separate branch. This will make it easier for the repository owner to review your changes and merge them into the main codebase.
+## Clone the repository to your local machine using
 
-When submitting a pull request, be sure to include a clear description of the changes you've made and why they are valuable. It's also a good idea to run any tests or linters included in the repository to ensure that your code meets the project's standards.
+  1. git clone https://github.com/bibhuti9/DSA-leetCode-JavaScript-Solution.git
+  
 
-Finally, be open to feedback and collaboration from other contributors. The LeetCode community on GitHub is a great place to connect with other developers and learn from their expertise. By working together, you can help to build a high-quality repository of LeetCode solutions that benefits the entire community.
+Each problem solution is located in its own file, with the name of the directory matching the LeetCode problem name. Within each directory, you will find the solution code, along with any additional files or notes.
+
+## Contributing
+If you would like to contribute to this repository, please open a pull request with your proposed changes. All contributions are welcome!
+
+## Feel free to add your solution with different languages
+
+License
+This repository is licensed under the **MIT License**.
diff --git a/question.txt b/question.txt
new file mode 100644
index 0000000..ee926c7
--- /dev/null
+++ b/question.txt
@@ -0,0 +1 @@
+## When you add more dsa question?