This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| 1st challenge solution:-- | |
| function target(nums, target) { | |
| let result = []; | |
| for(let i=0;i<nums.length;i++){ | |
| for(let j=i+1;j<nums.length;j++){ | |
| if(nums[i]+nums[j]==target){ | |
| result.push(i,j) | |
| } | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Submission links:- | |
| Leetcode challenge code link - | |
| https://github.com/Kawaritapas/leetcode-challenge/blob/main/README.md | |
| Github Link for the project and readme- | |
| https://github.com/Kawaritapas/onboard-1 | |
| I attempted these bonus points - |