From 1d12f9aeb7094454c3a42e2e8ae00031b7d77aa6 Mon Sep 17 00:00:00 2001
From: Aadil <77232799+aadil42@users.noreply.github.com>
Date: Sun, 23 Oct 2022 22:39:52 +0530
Subject: [PATCH 1/3] Creating a JS file for solving-pascals tringle.
Solved pascals-triangle in JS.
---
javascript/118-pascals-triangle.js | 31 ++++++++++++++++++++++++++++++
1 file changed, 31 insertions(+)
create mode 100644 javascript/118-pascals-triangle.js
diff --git a/javascript/118-pascals-triangle.js b/javascript/118-pascals-triangle.js
new file mode 100644
index 000000000..54005de22
--- /dev/null
+++ b/javascript/118-pascals-triangle.js
@@ -0,0 +1,31 @@
+
+// link to the problem https://leetcode.com/problems/pascals-triangle/
+// the time complexity will basically be the number of elements in pascale tringle. roughly height of tringle * number of honeycomb in each row.
+// O(n^2);
+
+var generate = function(num) {
+
+ const outerArray = [];
+ // adding first two rows of pascals triangle
+ if (num >= 2) {
+ outerArray.push([1]);
+ outerArray.push([1, 1]);
+ } else {
+ outerArray.push([1]);
+ }
+
+ // will only run if we had number greater than 2
+ if (num > 2) {
+ for (let i = 2; i < num; i++) {
+ let subArray = [];
+ subArray.push(1);
+ for (let j = 0; j < outerArray[i - 1].length - 1; j++) {
+ subArray.push(outerArray[i - 1][j] + outerArray[i - 1][j + 1]);
+ }
+ subArray.push(1);
+ outerArray.push(subArray);
+ }
+ }
+
+ return outerArray;
+ };
From e702cba31f01fedad3d9d8c4934bf0a210aa6a10 Mon Sep 17 00:00:00 2001
From: Aadil <77232799+aadil42@users.noreply.github.com>
Date: Wed, 26 Oct 2022 15:41:51 +0530
Subject: [PATCH 2/3] Create 560-subarray-sum-equals-k.js
Solving subarray-sum-equals-k in JS in O(n).
---
javascript/560-subarray-sum-equals-k.js | 23 +++++++++++++++++++++++
1 file changed, 23 insertions(+)
create mode 100644 javascript/560-subarray-sum-equals-k.js
diff --git a/javascript/560-subarray-sum-equals-k.js b/javascript/560-subarray-sum-equals-k.js
new file mode 100644
index 000000000..16d37fdb4
--- /dev/null
+++ b/javascript/560-subarray-sum-equals-k.js
@@ -0,0 +1,23 @@
+// problem link
+// https://leetcode.com/problems/subarray-sum-equals-k/
+
+
+// time complexity O(n);
+var subarraySum = function(nums, k) {
+
+
+const prefixMap = {};
+let totalSubArray = 0;
+let ongoingSum = 0;
+
+prefixMap[0] = 1;
+for(let i = 0; i < nums.length; i++) {
+ ongoingSum += nums[i];
+ if(prefixMap[ongoingSum - k]){
+ totalSubArray += prefixMap[ongoingSum - k];
+ }
+ prefixMap[ongoingSum] = (prefixMap[ongoingSum] ? prefixMap[ongoingSum] + 1: 1);
+}
+
+return totalSubArray;
+};
From 6504f627758e9b86ab9654d2b584fe8ead58aab4 Mon Sep 17 00:00:00 2001
From: Aadil <77232799+aadil42@users.noreply.github.com>
Date: Wed, 26 Oct 2022 15:44:14 +0530
Subject: [PATCH 3/3] Delete 560-subarray-sum-equals-k.js
---
javascript/560-subarray-sum-equals-k.js | 23 -----------------------
1 file changed, 23 deletions(-)
delete mode 100644 javascript/560-subarray-sum-equals-k.js
diff --git a/javascript/560-subarray-sum-equals-k.js b/javascript/560-subarray-sum-equals-k.js
deleted file mode 100644
index 16d37fdb4..000000000
--- a/javascript/560-subarray-sum-equals-k.js
+++ /dev/null
@@ -1,23 +0,0 @@
-// problem link
-// https://leetcode.com/problems/subarray-sum-equals-k/
-
-
-// time complexity O(n);
-var subarraySum = function(nums, k) {
-
-
-const prefixMap = {};
-let totalSubArray = 0;
-let ongoingSum = 0;
-
-prefixMap[0] = 1;
-for(let i = 0; i < nums.length; i++) {
- ongoingSum += nums[i];
- if(prefixMap[ongoingSum - k]){
- totalSubArray += prefixMap[ongoingSum - k];
- }
- prefixMap[ongoingSum] = (prefixMap[ongoingSum] ? prefixMap[ongoingSum] + 1: 1);
-}
-
-return totalSubArray;
-};
pFad - Phonifier reborn
Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies:
Alternative Proxy
pFad Proxy
pFad v3 Proxy
pFad v4 Proxy