linkedlist

Author: Narahari-Sundaragopalan

exercises/leetcode/intersectionLinkedList.js

@@ -0,0 +1,11 @@
+const getIntersectionNode = (headA, headB) => {
+	let ptrA = headA;
+	let ptrB = headB;
+
+	while (ptrA !== ptrB) {
+		ptrA = ptrA !== null ? ptrA.next : headB;
+		ptrB = ptrB !== null ? ptrB.next : headA;
+	}
+
+	return (ptrA === ptrB && ptrA !== null) ? ptrA : null;
+}

exercises/leetcode/maxPathSumBinaryTree.js

@@ -1,7 +1,8 @@
 /**
  * Given a non-empty binary tree, find the maximum path sum.
 
-For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path must contain at least one node and does not need to go through the root.
+For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. 
+The path must contain at least one node and does not need to go through the root.
 
 Example 1:
 

exercises/leetcode/setZeroes.js

@@ -55,8 +55,8 @@ const setZeroes = matrix => {
 		}
 	}
 
-	for (let i = 0; i < rows; i++) {
-		for (let j = 0; j < columns; j++) {
+	for (let i = 1; i < rows; i++) {
+		for (let j = 1; j < columns; j++) {
 			if (matrix[i][0] === 0 || matrix[0][j] === 0) {
 				matrix[i][j] = 0;
 			}