Aug 15, 2022 · Aug 9, 2022 · Aug 9, 2022 · Aug 11, 2022
diff --git a/README.md b/README.md

 | ID  | Title                                                                                                                                           | Solution                                                                                                                | Difficulty |
 |-----|-------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------|------------|
 | 1   | [Two Sum](https://leetcode.com/problems/two-sum/)                                                                                               | [JavaScript](./src/two-sum/res.js)                                                                                      | Easy       |
 | 1   | [Two Sum](https://leetcode.com/problems/two-sum/)                                                                                               | [JavaScript](./src/two-sum/res.js)· [TypeScript](./src/two-sum/res.ts)                                                                                      | Easy       |
 | 2   | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)                                                                               | [JavaScript](./src/add-two-numbers/res.js)                                                                              | Medium     |
 | 3   | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)                 | [JavaScript](./src/longest-substring-without-repeating-characters/res.js)                                               | Medium     |
 | 4   | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)                                                       | [JavaScript](./src/median-of-two-sorted-arrays/res.js)                                                                  | Hard       |
diff --git a/src/two-sum/res.ts b/src/two-sum/res.ts
 /**
 * Problem: Given an array of integers, return indices of the two numbers such that they add up to a specific target.
 *
 * You may assume that each input would have exactly one solution, and you may not use the same element twice.
 *
 *
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */

 const twoSum =(nums:Array<number>, target:number): Array<number>  => {

 for (let i = nums.length - 1; i >= 0; i--) {
 for (let j = 0; j < i; j++) {
 if ( addition(nums[i], nums[j]) === target ) {
 return [j, i];
 }
 }
 }

    return [];
 };

 // add a with b and return it
 const addition = (a:number, b:number) => {
 return a + b;
 };
Original file line number	Diff line number	Diff line change
Expand Up		@@ -8,7 +8,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr

		\| ID \| Title \| Solution \| Difficulty \|
		\|-----\|-------------------------------------------------------------------------------------------------------------------------------------------------\|-------------------------------------------------------------------------------------------------------------------------\|------------\|
		\| 1 \| [Two Sum](https://leetcode.com/problems/two-sum/) \| [JavaScript](./src/two-sum/res.js) \| Easy \|
		\| 1 \| [Two Sum](https://leetcode.com/problems/two-sum/) \| [JavaScript](./src/two-sum/res.js)· [TypeScript](./src/two-sum/res.ts) \| Easy \|
		\| 2 \| [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) \| [JavaScript](./src/add-two-numbers/res.js) \| Medium \|
		\| 3 \| [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) \| [JavaScript](./src/longest-substring-without-repeating-characters/res.js) \| Medium \|
		\| 4 \| [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) \| [JavaScript](./src/median-of-two-sorted-arrays/res.js) \| Hard \|
Expand Down
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,28 @@
		/**
		* Problem: Given an array of integers, return indices of the two numbers such that they add up to a specific target.
		*
		* You may assume that each input would have exactly one solution, and you may not use the same element twice.
		*
		*
		* @param {number[]} nums
		* @param {number} target
		* @return {number[]}
		*/

		const twoSum =(nums:Array<number>, target:number): Array<number> => {

		for (let i = nums.length - 1; i >= 0; i--) {
		for (let j = 0; j < i; j++) {
		if ( addition(nums[i], nums[j]) === target ) {
		return [j, i];
		}
		}
		}

		return [];
		};

		// add a with b and return it
		const addition = (a:number, b:number) => {
		return a + b;
		};