From d2f667547bbce1baecb03e5f241c66ab9e99b76d Mon Sep 17 00:00:00 2001 From: Brand New <36328136+bibhuti9@users.noreply.github.com> Date: Wed, 28 Feb 2024 00:23:51 +0530 Subject: [PATCH 1/4] Delete README.md --- README.md | 23 ----------------------- 1 file changed, 23 deletions(-) delete mode 100644 README.md diff --git a/README.md b/README.md deleted file mode 100644 index 189ff2c..0000000 --- a/README.md +++ /dev/null @@ -1,23 +0,0 @@ -# LeetCode Problem Solutions in JavaScript -This repository contains my solutions to various LeetCode problems in JavaScript. - -## Getting Started -To run the code and test the solutions - - 1. Download Node.js - - -## Clone the repository to your local machine using - - 1. git clone https://github.com/bibhuti9/DSA-leetCode-JavaScript-Solution.git - - -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**. From 982540ec20a626c5f1aaea22ca01ddc31de80cc7 Mon Sep 17 00:00:00 2001 From: Brand New <36328136+bibhuti9@users.noreply.github.com> Date: Wed, 28 Feb 2024 00:24:14 +0530 Subject: [PATCH 2/4] Create README.md --- README.md | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 README.md diff --git a/README.md b/README.md new file mode 100644 index 0000000..189ff2c --- /dev/null +++ b/README.md @@ -0,0 +1,23 @@ +# LeetCode Problem Solutions in JavaScript +This repository contains my solutions to various LeetCode problems in JavaScript. + +## Getting Started +To run the code and test the solutions + + 1. Download Node.js + + +## Clone the repository to your local machine using + + 1. git clone https://github.com/bibhuti9/DSA-leetCode-JavaScript-Solution.git + + +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**. From 4a039812876b69c98b1d5db6cbf9c0e6efcdf306 Mon Sep 17 00:00:00 2001 From: bibhutiswain9 Date: Sun, 3 Mar 2024 17:21:37 +0530 Subject: [PATCH 3/4] 2. Add Two Numbers --- Medium/2. Add Two Numbers.js | 54 ++++++++++++++++++++++++++++++++++++ 1 file changed, 54 insertions(+) create mode 100644 Medium/2. Add Two Numbers.js 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; +}; From 272598b6ab02df0aa9ef5a0778eefa7e1bb570ef Mon Sep 17 00:00:00 2001 From: bibhutigswain Date: Fri, 31 May 2024 01:18:37 +0530 Subject: [PATCH 4/4] Create question.txt --- question.txt | 1 + 1 file changed, 1 insertion(+) create mode 100644 question.txt 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?