Merge branch 'release/1.25.0'

Author: ecgan

README.md

@@ -55,33 +55,60 @@ The listing below is sorted based on LeetCode #. If you are interested to see my
 | 55 | [Jump Game](/problems/jump-game) | Medium | Array, Greedy |
 | 64 | [Minimum Path Sum](/problems/minimum-path-sum) | Medium | Array, Dynamic Programming |
 | 70 | [Climbing Stairs](/problems/climbing-stairs) | Easy | Dynamic Programming |
+| 72 | [Edit Distance](/problems/edit-distance) | Hard | String, Dynamic Programming |
 | 121 | [Best Time to Buy and Sell Stock](/problems/best-time-to-buy-and-sell-stock) | Easy | Array, Dynamic Programming |
 | 122 | [Best Time to Buy and Sell Stock II](/problems/best-time-to-buy-and-sell-stock-ii) | Easy | Array, Greedy |
 | 124 | [Binary Tree Maximum Path Sum](/problems/binary-tree-maximum-path-sum) | Hard | Tree, Depth-first Search |
 | 136 | [Single Number](/problems/single-number) | Easy | Hash table, bit manipulation |
 | 146 | [LRU Cache](/problems/lru-cache) | Medium | Design |
 | 155 | [Min Stack](/problems/min-stack) | Easy | Stack, Design |
+| 169 | [Majority Element](/problems/majority-element) | Easy | Array, Divide and Conquer, Bit Manipulation |
 | 189 | [Rotate Array](/problems/rotate-array) | Easy | Array |
 | 198 | [House Robber](/problems/house-robber) | Easy | Dynamic Programming |
 | 200 | [Number of Islands](/problems/number-of-islands) | Medium | Depth-first Search, Breadth-first Search, Union Find |
 | 201 | [Bitwise AND of Numbers Range](/problems/bitwise-and-of-numbers-range) | Medium | Bit Manipulation |
 | 202 | [Happy Number](/problems/happy-number) | Easy | Hash Table, Math |
+| 207 | [Course Schedule](/problems/course-schedule) | Medium | Depth-first Search, Breadth-first Search, Graph, Topological Sort |
+| 208 | [Implement Trie (Prefix Tree)](/problems/implement-trie-prefix-tree) | Medium | Design, Trie |
 | 221 | [Maximal Square](/problems/maximal-square) | Medium | Dynamic Programming |
+| 230 | [Kth Smallest Element in a BST](/problems/kth-smallest-element-in-a-bst) | Medium | Binary Search, Tree |
 | 238 | [Product of Array Except Self](/problems/product-of-array-except-self) | Medium | Array |
+| 278 | [First Bad Version](/problems/first-bad-version) | Easy | Binary Search |
 | 283 | [Move Zeroes](/problems/move-zeroes) | Easy | Array, Two Pointers |
 | 303 | [Range Sum Query - Immutable](/problems/range-sum-query-immutable) | Easy | Dynamic Programming |
+| 328 | [Odd Even Linked List](/problems/odd-even-linked-list) | Medium | Linked List |
+| 338 | [Counting Bits](/problems/counting-bits) | Medium | Dynamic Programming, Bit Manipulation |
 | 349 | [Intersection of Two Arrays](/problems/intersection-of-two-arrays) | Easy | Hash table, two pointers, binary search, sort, set |
 | 350 | [Intersection of Two Arrays II](/problems/intersection-of-two-arrays-ii) | Easy | Hash Table, two pointers, binary search, sort |
+| 367 | [Valid Perfect Square](/problems/valid-perfect-square) | Easy | Math, Binary Search |
+| 383 | [Ransom Note](/problems/ransom-note) | Easy | String |
+| 387 | [First Unique Character in a String](/problems/first-unique-character-in-a-string) | Easy | Hash Table, String |
 | 392 | [Is Subsequence](/problems/is-subsequence) | Easy | Binary Search, Dynamic Programming, Greedy |
+| 402 | [Remove K Digits](/problems/remove-k-digits) | Medium | Stack, Greedy |
+| 438 | [Find All Anagrams in a String](/problems/find-all-anagrams-in-a-string) | Medium | Hash Table |
+| 451 | [Sort Characters By Frequency](/problems/sort-characters-by-frequency) | Medium | Hash Table, Heap |
+| 476 | [Number Complement](/problems/number-complement) | Easy | Bit Manipulation |
 | 525 | [Contiguous Array](/problems/contiguous-array) | Medium | Hash Table |
+| 540 | [Single Element in a Sorted Array](/problems/single-element-in-a-sorted-array) | Medium | - |
 | 543 | [Diameter of Binary Tree](/problems/diameter-of-binary-tree) | Easy | Tree |
 | 560 | [Subarray Sum Equals K](/problems/subarray-sum-equals-k) | Medium | Array, Hash Table |
+| 567 | [Permutation in String](/problems/permutation-in-string) | Medium | Two Pointers, Sliding Window |
 | 678 | [Valid Parenthesis String](/problems/valid-parenthesis-string) | Medium | String |
+| 733 | [Flood Fill](/problems/flood-fill) | Easy | Depth-first Search |
 | 746 | [Min Cost Climbing Stairs](/problems/min-cost-climbing-stairs) | Easy | Array, Dynamic Programming |
+| 771 | [Jewels and Stones](/problems/jewels-and-stones) | Easy | Hash Table |
 | 844 | [Backspace String Compare](/problems/backspace-string-compare) | Easy | Two Pointers, Stack |
 | 876 | [Middle of the Linked List](/problems/middle-of-the-linked-list) | Easy | Linked List |
+| 886 | [Possible Bipartition](/problems/possible-bipartition) | Medium | Depth-first Search |
+| 901 | [Online Stock Span](/problems/online-stock-span) | Medium | Stack |
+| 918 | [Maximum Sum Circular Subarray](/problems/maximum-sum-circular-subarray) | Medium | Array |
+| 973 | [K Closest Points to Origin](/problems/k-closest-points-to-origin) | Medium | Divide and Conquer, Heap, Sort |
+| 986 | [Interval List Intersections](/problems/interval-list-intersections) | Medium | Two Pointers |
+| 993 | [Cousins in Binary Tree](/problems/cousins-in-binary-tree) | Easy | Tree, Breadth-first Search |
+| 997 | [Find the Town Judge](/problems/find-the-town-judge) | Easy | Graph |
 | 1008 | [Construct Binary Search Tree from Preorder Traversal](/problems/construct-binary-search-tree-from-preorder-traversal) | Medium | Tree |
 | 1025 | [Divisor Game](/problems/divisor-game) | Easy | Math, Dynamic Programming |
+| 1035 | [Uncrossed Lines](/problems/uncrossed-lines) | Medium | Array |
 | 1046 | [Last Stone Weight](/problems/last-stone-weight) | Easy | Heap, Greedy |
 | 1143 | [Longest Common Subsequence](/problems/longest-common-subsequence) | Medium | Dynamic Programming |
 | 1144 | [Decrease Elements To Make Array Zigzag](/problems/decrease-elements-to-make-array-zigzag) | Medium | Array |
@@ -104,6 +131,7 @@ The listing below is sorted based on LeetCode #. If you are interested to see my
 | 1213 | [Intersection of Three Sorted Arrays](/problems/intersection-of-three-sorted-arrays) | Easy | Hash table, two pointers |
 | 1214 | [Two Sum BSTs](/problems/two-sum-bsts) | Medium | Binary search tree |
 | 1217 | [Play with Chips](/problems/play-with-chips) | Easy | Array, math, greedy |
+| 1232 | [Check If It Is a Straight Line](/problems/check-if-it-is-a-straight-line) | Easy | Array, Math, Geometry |
 | 1243 | [Array Transformation](/problems/array-transformation) | Easy | Array |
 | 1244 | [Design A Leaderboard](/problems/design-a-leaderboard) | Medium | Hash table, sort, design |
 | 1247 | [Minimum Swaps to Make Strings Equal](/problems/minimum-swaps-to-make-strings-equal) | Medium | String, greedy |
@@ -114,6 +142,7 @@ The listing below is sorted based on LeetCode #. If you are interested to see my
 | 1272 | [Remove Interval](/problems/remove-interval) | Medium | Math, line sweep |
 | 1275 | [Find Winner on a Tic Tac Toe Game](/problems/find-winner-on-a-tic-tac-toe-game) | Easy | Array |
 | 1276 | [Number of Burgers with No Waste of Ingredients](/problems/number-of-burgers-with-no-waste-of-ingredients) | Medium | Math, greedy |
+| 1277 | [Count Square Submatrices with All Ones](/problems/count-square-submatrices-with-all-ones) | Medium | Array, Dynamic Programming |
 | 1313 | [Decompress Run-Length Encoded List](/problems/decompress-run-length-encoded-list) | Easy | Array |
 | 1314 | [Matrix Block Sum](/problems/matrix-block-sum) | Medium | Dynamic programming |
 | 1317 | [Convert Integer to the Sum of Two No-Zero Integers](/problems/convert-integer-to-the-sum-of-two-no-zero-integers) | Easy | Math |

package-lock.json

@@ -1,6 +1,6 @@
 {
   "name": "leetcode",
-  "version": "1.24.0",
+  "version": "1.25.0",
   "description": "My solutions for LeetCode problems.",
   "main": "index.js",
   "scripts": {

package.json

@@ -0,0 +1,42 @@
+# Check If It Is a Straight Line
+
+LeetCode #: [1232](https://leetcode.com/problems/check-if-it-is-a-straight-line/)
+
+Difficulty: Easy
+
+Topic: Array, Math, Geometry.
+
+## Problem
+
+You are given an array `coordinates`, `coordinates[i] = [x, y]`, where `[x, y]` represents the coordinate of a point. Check if these points make a straight line in the XY plane.
+
+Example 1:
+
+![Example 1](https://assets.leetcode.com/uploads/2019/10/15/untitled-diagram-2.jpg)
+
+```text
+Input: coordinates = [[1,2],[2,3],[3,4],[4,5],[5,6],[6,7]]
+Output: true
+```
+
+Example 2:
+
+![Example 2](https://assets.leetcode.com/uploads/2019/10/09/untitled-diagram-1.jpg)
+
+```text
+Input: coordinates = [[1,1],[2,2],[3,4],[4,5],[5,6],[7,7]]
+Output: false
+```
+
+Constraints:
+
+- `2 <= coordinates.length <= 1000`
+- `coordinates[i].length == 2`
+- `-10^4 <= coordinates[i][0], coordinates[i][1] <= 10^4`
+- `coordinates` contains no duplicate point.
+
+## Complexity Analysis
+
+Time complexity: O(n)
+
+Space complexity: O(1)

problems/check-if-it-is-a-straight-line/README.md

@@ -0,0 +1,30 @@
+const getSlope = (point1, point2) => {
+  const [x1, y1] = point1
+  const [x2, y2] = point2
+  const diffX = x2 - x1
+  const diffY = y2 - y1
+
+  return (diffX === 0)
+    ? null
+    : (diffY / diffX)
+}
+
+/**
+ * @param {number[][]} coordinates
+ * @return {boolean}
+ */
+const checkStraightLine = function (coordinates) {
+  const slope = getSlope(coordinates[0], coordinates[1])
+
+  for (let i = 2; i < coordinates.length; i++) {
+    const curSlope = getSlope(coordinates[i - 1], coordinates[i])
+
+    if (curSlope !== slope) {
+      return false
+    }
+  }
+
+  return true
+}
+
+module.exports = checkStraightLine

problems/check-if-it-is-a-straight-line/checkStraightLine.js

@@ -0,0 +1,33 @@
+const checkStraightLine = require('./checkStraightLine')
+
+test('Example 1', () => {
+  const coordinates = [[1, 2], [2, 3], [3, 4], [4, 5], [5, 6], [6, 7]]
+
+  const result = checkStraightLine(coordinates)
+
+  expect(result).toBe(true)
+})
+
+test('Example 2', () => {
+  const coordinates = [[1, 1], [2, 2], [3, 4], [4, 5], [5, 6], [7, 7]]
+
+  const result = checkStraightLine(coordinates)
+
+  expect(result).toBe(false)
+})
+
+test('horizontal straight line', () => {
+  const coordinates = [[-3, -2], [-1, -2], [2, -2], [-2, -2], [0, -2]]
+
+  const result = checkStraightLine(coordinates)
+
+  expect(result).toBe(true)
+})
+
+test('vertical straight line', () => {
+  const coordinates = [[1, 3], [1, 4], [1, 5]]
+
+  const result = checkStraightLine(coordinates)
+
+  expect(result).toBe(true)
+})

problems/check-if-it-is-a-straight-line/checkStraightLine.test.js

@@ -0,0 +1,56 @@
+# Count Square Submatrices with All Ones
+
+LeetCode #: [1277](https://leetcode.com/problems/count-square-submatrices-with-all-ones/)
+
+Difficulty: Medium
+
+Topic: Array, Dynamic Programming.
+
+## Problem
+
+Given a `m * n` matrix of ones and zeros, return how many square submatrices have all ones.
+
+Example 1:
+
+```text
+Input: matrix =
+[
+  [0,1,1,1],
+  [1,1,1,1],
+  [0,1,1,1]
+]
+Output: 15
+Explanation: 
+There are 10 squares of side 1.
+There are 4 squares of side 2.
+There is  1 square of side 3.
+Total number of squares = 10 + 4 + 1 = 15.
+```
+
+Example 2:
+
+```text
+Input: matrix = 
+[
+  [1,0,1],
+  [1,1,0],
+  [1,1,0]
+]
+Output: 7
+Explanation: 
+There are 6 squares of side 1.  
+There is 1 square of side 2. 
+Total number of squares = 6 + 1 = 7.
+```
+
+Constraints:
+
+- `1 <= arr.length <= 300`
+- `1 <= arr[0].length <= 300`
+- `0 <= arr[i][j] <= 1`
+
+## Complexity Analysis
+
+Time complexity: O(m*n)
+
+Space complexity: O(1)

problems/count-square-submatrices-with-all-ones/README.md

@@ -0,0 +1,23 @@
+/**
+ * @param {number[][]} matrix
+ * @return {number}
+ */
+const countSquares = function (matrix) {
+  let count = 0
+
+  for (let i = 0; i < matrix.length; i++) {
+    for (let j = 0; j < matrix[i].length; j++) {
+      if (matrix[i][j] === 1) {
+        const up = (matrix[i - 1] && matrix[i - 1][j]) || 0
+        const upleft = (matrix[i - 1] && matrix[i - 1][j - 1]) || 0
+        const left = (matrix[i][j - 1]) || 0
+        matrix[i][j] += Math.min(up, upleft, left)
+        count += matrix[i][j]
+      }
+    }
+  }
+
+  return count
+}
+
+module.exports = countSquares

problems/count-square-submatrices-with-all-ones/countSquares.js

@@ -0,0 +1,25 @@
+const countSquares = require('./countSquares')
+
+test('Example 1', () => {
+  const matrix = [
+    [0, 1, 1, 1],
+    [1, 1, 1, 1],
+    [0, 1, 1, 1]
+  ]
+
+  const result = countSquares(matrix)
+
+  expect(result).toBe(15)
+})
+
+test('Example 2', () => {
+  const matrix = [
+    [1, 0, 1],
+    [1, 1, 0],
+    [1, 1, 0]
+  ]
+
+  const result = countSquares(matrix)
+
+  expect(result).toBe(7)
+})

problems/count-square-submatrices-with-all-ones/countSquares.test.js

@@ -0,0 +1,36 @@
+# Counting Bits
+
+LeetCode #: [338](https://leetcode.com/problems/counting-bits/)
+
+Difficulty: Medium
+
+Topics: Dynamic Programming, Bit Manipulation.
+
+## Problem
+
+Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.
+
+Example 1:
+
+```text
+Input: 2
+Output: [0,1,1]
+```
+
+Example 2:
+
+```text
+Input: 5
+Output: [0,1,1,2,1,2]
+```
+
+Follow up:
+
+- It is very easy to come up with a solution with run time O(n*sizeof(integer)). But can you do it in linear time O(n) /possibly in a single pass?
+- Space complexity should be O(n).
+- Can you do it like a boss? Do it without using any builtin function like __builtin_popcount in c++ or in any other language.
+
+## Solution Explanation
+
+Reference: [Three-Line Java Solution](https://leetcode.com/problems/counting-bits/discuss/79539/Three-Line-Java-Solution) by [lixx2100
+](https://leetcode.com/lixx2100)