Merge pull request neetcode-gh#279 from siddheshranade/siddheshranade-patch-1

Create 234-Palindrome-Linked-List.js

Author: neetcode-gh

javascript/160-Intersection-of-Two-Linked-Lists.js

@@ -0,0 +1,23 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+
+/**
+ * @param {ListNode} headA
+ * @param {ListNode} headB
+ * @return {ListNode}
+ */
+var getIntersectionNode = function(headA, headB) {
+    let a = headA;
+    let b = headB;
+    while (a !== b) {
+        a = a === null ? headB : a.next;
+        b = b === null ? headA : b.next;
+    }
+        
+    return a;
+};

javascript/234-Palindrome-Linked-List.js

@@ -0,0 +1,43 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @return {boolean}
+ */
+var isPalindrome = function(head) {
+    // find mid point
+    let slow = head;
+    let fast = head;
+    while (fast && fast.next) {
+        slow = slow.next;
+        fast = fast.next.next;
+    }
+    
+    // reverse 2nd half
+    let curr = slow;
+    let prev = null;
+    while (curr) {
+        let next = curr.next;
+        curr.next = prev;
+        prev = curr;
+        curr = next;
+    }
+    let head2 = prev;
+    
+    // compare both halfs
+    while (head && head2) {
+        if (head.val !== head2.val) {
+            return false;
+        }
+        
+        head = head.next;
+        head2 = head2.next;
+    }
+    
+    return true;
+};

javascript/35-Search-Insert-Position.js

@@ -0,0 +1,23 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var searchInsert = function(nums, target) {
+    let left = 0;
+    let right = nums.length - 1;
+    while (left <= right) {
+        let midIdx = Math.floor((left + right) / 2);
+        if (target === nums[midIdx]) {
+            return midIdx;
+        }
+
+        if (target > nums[midIdx]) {
+            left = midIdx + 1;
+        } else {
+            right = midIdx - 1;
+        }        
+    }
+    
+    return left;
+};