Merge branch 'master' of github.com:amejiarosario/dsa.js-data-structures-algorithms-javascript

Author: amejiarosario

.circleci/config.yml

@@ -46,6 +46,10 @@ jobs: # a collection of steps
       - store_test_results: # for display in Test Summary: https://circleci.com/docs/2.0/collect-test-data/
           path: test-results.xml
 
+      - run:
+          name: release
+          command: npm run semantic-release || true
+
   docs:
     docker:
       - image: circleci/ruby:2.5.3-stretch-node

.eslintrc.js

@@ -15,7 +15,8 @@ module.exports = {
 
     // https://eslint.org/docs/rules/no-plusplus
     // allows unary operators ++ and -- in the afterthought (final expression) of a for loop.
-    'no-plusplus': [2, { 'allowForLoopAfterthoughts': true }],
+    'no-plusplus': [0, { 'allowForLoopAfterthoughts': true }],
+    'no-continue': [0],
 
     // Allow for..of
     'no-restricted-syntax': [0, 'ForOfStatement'],

.node-version

@@ -1 +1 @@
-10.12.0
+12.16.1

CHANGELOG.md

@@ -1,3 +1,77 @@
+# [1.10.0](https://github.com/amejiarosario/dsa.js/compare/1.9.0...1.10.0) (2020-07-28)
+
+
+### Features
+
+* **book/arrays:** add exercises ([bcaf819](https://github.com/amejiarosario/dsa.js/commit/bcaf81919cb889c1209c6d1e577b037047714c05))
+
+# [1.9.0](https://github.com/amejiarosario/dsa.js/compare/1.8.3...1.9.0) (2020-06-30)
+
+
+### Features
+
+* **heap:** remove by index ([6af937f](https://github.com/amejiarosario/dsa.js/commit/6af937fb380ffcd26558193c1626bdb84b2abe17))
+* **linkedList:** takes iterables in the constructor ([1fa875f](https://github.com/amejiarosario/dsa.js/commit/1fa875fd772eb4a45dd9690bea593b513687caca))
+
+## [1.8.3](https://github.com/amejiarosario/dsa.js/compare/1.8.2...1.8.3) (2020-05-24)
+
+
+### Bug Fixes
+
+* **book/maps:** update space complexity ([0be0176](https://github.com/amejiarosario/dsa.js/commit/0be0176efc121c5608c1a2df25280d6d9c08e6f3))
+
+## [1.8.2](https://github.com/amejiarosario/dsa.js/compare/1.8.1...1.8.2) (2020-05-24)
+
+
+### Bug Fixes
+
+* **book/hashset:** update hashset space complexity ([0319b29](https://github.com/amejiarosario/dsa.js/commit/0319b29e92a630c5f14d5e3208b72fe536b38f43))
+
+## [1.8.1](https://github.com/amejiarosario/dsa.js/compare/1.8.0...1.8.1) (2020-05-24)
+
+
+### Bug Fixes
+
+* **book/maps:** update time/space complexity values ([3c4ef75](https://github.com/amejiarosario/dsa.js/commit/3c4ef7555c400828fb89339184294feb7169b215))
+
+# [1.8.0](https://github.com/amejiarosario/dsa.js/compare/1.7.1...1.8.0) (2020-05-23)
+
+
+### Bug Fixes
+
+* **book/map:** fix typo on maps space complexity ([2f24f57](https://github.com/amejiarosario/dsa.js/commit/2f24f57f989bb97f198bb32f6daa477d6075dc31))
+* **hashmap:** improve methods documentation ([f6b47b5](https://github.com/amejiarosario/dsa.js/commit/f6b47b5a6c53126bebbad72ac92da1a594042232))
+
+
+### Features
+
+* **maps:** implement clear method for hashMap and treeMap ([924c9a7](https://github.com/amejiarosario/dsa.js/commit/924c9a76db91f7df44f7cb38caba3aa9c3f0497f))
+
+## [1.7.1](https://github.com/amejiarosario/dsa.js/compare/1.7.0...1.7.1) (2020-05-20)
+
+
+### Bug Fixes
+
+* **hashmap:** fix TextEncoder reference ([e13ff88](https://github.com/amejiarosario/dsa.js/commit/e13ff88d7f8f9b7f38844befedc001bc1a4b243f))
+
+# [1.7.0](https://github.com/amejiarosario/dsa.js/compare/1.6.0...1.7.0) (2020-05-16)
+
+
+### Features
+
+* **heap:** add min/max/median-heaps ([202ca9f](https://github.com/amejiarosario/dsa.js/commit/202ca9f989ddba433b4f591e27bc094640cbbadf))
+
+# [1.6.0](https://github.com/amejiarosario/dsa.js/compare/1.5.0...1.6.0) (2020-05-08)
+
+# [1.5.0](https://github.com/amejiarosario/dsa.js/compare/1.4.0...1.5.0) (2020-03-30)
+
+
+### Features
+
+* **linkedList:** remove by node ([eac045a](https://github.com/amejiarosario/dsa.js/commit/eac045a6bedd0223a2e8b12225f87c428e6fb66f))
+* **lru-cache:** add new implementations ([3e787c6](https://github.com/amejiarosario/dsa.js/commit/3e787c6f9ba9c094272be5ac05b997ce44a359d3))
+* **trie:** remove method ([16005f3](https://github.com/amejiarosario/dsa.js/commit/16005f3bf39597759918e34b39d27eb25a5755e7))
+
 # Changelog
 
 All notable changes to this project will be documented in this file.
@@ -13,6 +87,24 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ### Bug Fixes (patch)
 
+## [1.3.9]
+
+### Breaking Changes (major)
+
+### New Features (minor)
+
+### Bug Fixes (patch)
+- fix(book): fix table typos [commit](https://github.com/amejiarosario/dsa.js/commit/bc51a7a0c97aea9dea1afa5f8af22c0bed1382d3)
+
+## [1.3.8]
+
+### Breaking Changes (major)
+
+### New Features (minor)
+
+### Bug Fixes (patch)
+- fix(book): fix typo, array pop, and BST images [commit](https://github.com/amejiarosario/dsa.js/commit/ac9858348943f9678d116c8076bfa3a3c5362741)
+
 ## [1.3.7]
 
 ### Breaking Changes (major)
@@ -125,7 +217,9 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 -
 
-[Unreleased]: https://github.com/amejiarosario/dsa.js/compare/1.3.7...HEAD
+[Unreleased]: https://github.com/amejiarosario/dsa.js/compare/1.3.9...HEAD
+[1.3.9]: https://github.com/amejiarosario/dsa.js/compare/1.3.8...1.3.9
+[1.3.7]: https://github.com/amejiarosario/dsa.js/compare/1.3.7...1.3.8
 [1.3.6]: https://github.com/amejiarosario/dsa.js/compare/1.3.6...1.3.7
 [1.3.6]: https://github.com/amejiarosario/dsa.js/compare/1.3.5...1.3.6
 [1.3.5]: https://github.com/amejiarosario/dsa.js/compare/1.3.4...1.3.5

CONTRIBUTING.md

@@ -137,15 +137,9 @@ If the commit reverts a previous commit, it should begin with `revert: `, follow
 ### Type
 Must be one of the following:
 
-* **feat**: A new feature
 * **fix**: A bug fix
-* **docs**: Documentation only changes
-* **build**: Changes that affect the build system or external dependencies (example scopes: gulp, broccoli, npm)
-* **ci**: Changes to our CI configuration files and scripts (example scopes: Circle, BrowserStack, SauceLabs)
-* **test**: Adding missing tests or correcting existing tests
-* **refactor**: A code change that neither fixes a bug nor adds a feature
-* **style**: Changes that do not affect the meaning of the code (white-space, formatting, missing semi-colons, etc)
-* **perf**: A code change that improves performance
+* **feat**: A new feature
+* **chore**: Changes to our CI configuration files and scripts (example scopes: Circle, BrowserStack, SauceLabs)
 
 ### Scope
 The scope should be the name of the npm package affected (as perceived by the person reading the changelog generated from commit messages.
@@ -171,7 +165,7 @@ Just as in the **subject**, use the imperative, present tense: "change" not "cha
 The body should include the motivation for the change and contrast this with previous behavior.
 
 ### Footer
-The footer should contain any information about **Breaking Changes** and is also the place to
+The footer should contain any information about **BREAKING CHANGES** and is also the place to
 reference GitHub issues that this commit **Closes**.
 
 ```

README.md

@@ -2,7 +2,7 @@
 
 # Data Structures and Algorithms in JavaScript
 
-[![CircleCI](https://img.shields.io/circleci/build/github/amejiarosario/dsa.js-data-structures-algorithms-javascript/master.svg)](https://circleci.com/gh/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript) [![NPM version](https://badge.fury.io/js/dsa.js.svg)](https://badge.fury.io/js/dsa.js) [![chat](https://dsajs-slackin.herokuapp.com/badge.svg)](https://dsajs-slackin.herokuapp.com)
+[![CircleCI](https://circleci.com/gh/amejiarosario/dsa.js-data-structures-algorithms-javascript.svg?style=shield)](https://app.circleci.com/pipelines/github/amejiarosario/dsa.js-data-structures-algorithms-javascript) [![NPM version](https://badge.fury.io/js/dsa.js.svg)](https://badge.fury.io/js/dsa.js) [![chat](https://dsajs-slackin.herokuapp.com/badge.svg)](https://dsajs-slackin.herokuapp.com)
 
 > This is the coding implementations of the [DSA.js book](https://books.adrianmejia.com/dsajs-data-structures-algorithms-javascript/) and the repo for the NPM package.
 
@@ -91,7 +91,6 @@ _Note: If you prefer to consume the information more linearly then the [book for
 
 The topics are divided into four main categories as you can see below:
 
-_(You can click on the triangle ⯈ to expand the topics)_
 
 ### 📈 [Algorithms Analysis](book/part01-algorithms-analysis.asc)
 
@@ -103,7 +102,7 @@ _(You can click on the triangle ⯈ to expand the topics)_
 
 <details>
   <summary>
-    Computer Science nuggets without all the mumbo-jumbo
+    Computer Science nuggets without all the mumbo-jumbo. <i>(Click to expand)</i>
   </summary>
 
 ---
@@ -120,7 +119,7 @@ _(You can click on the triangle ⯈ to expand the topics)_
 
 <details>
   <summary>
-    Learn how to compare algorithms using Big O notation.
+    Learn how to compare algorithms using Big O notation. <i>(Click to expand)</i>
   </summary>
 
 ---
@@ -142,7 +141,7 @@ they take different time to complete.
 
 <details>
   <summary>
-    8 examples to explain with code how to calculate time complexity
+    8 examples to explain with code how to calculate time complexity. <i>(Click to expand)</i>
   </summary>
 
 ---
@@ -181,7 +180,7 @@ they take different time to complete.
 
   <details>
     <summary>
-      Understand the ins and outs of the most common data structures.
+      Understand the ins and outs of the most common data structures. <i>(Click to expand)</i>
     </summary>
 
 ---
@@ -216,7 +215,7 @@ they take different time to complete.
   </details>
   <details>
     <summary>
-      When to use an Array or Linked List. Know the tradeoffs.
+      When to use an Array or Linked List. Know the tradeoffs. <i>(Click to expand)</i>
     </summary>
 
 ---
@@ -239,7 +238,7 @@ Use Linked Lists when:
   </details>
   <details>
     <summary>
-      Build a List, Stack, and a Queue.
+      Build a List, Stack, and a Queue. <i>(Click to expand)</i>
     </summary>
 
   ---
@@ -264,7 +263,7 @@ Use Linked Lists when:
 <blockquote>
   <details>
     <summary>
-      Understand one of the most versatile data structure of all: Maps
+      Understand one of the most versatile data structure of all: Hash Maps. <i>(Click to expand)</i>
     </summary>
 
 ---
@@ -289,7 +288,7 @@ Also, [learn the difference between the different Maps implementations](book/con
 
   <details>
     <summary>
-    Know the properties of Graphs and Trees.
+    Know the properties of Graphs and Trees. <i>(Click to expand)</i>
     </summary>
 
 ---
@@ -391,7 +390,7 @@ From unbalanced BST to balanced BST
 <blockquote>
   <details>
     <summary>
-      Never get stuck solving a problem with 7 simple steps
+      Never get stuck solving a problem with 7 simple steps. <i>(Click to expand)</i>
     </summary>
 
 ---
@@ -414,7 +413,7 @@ Full details [here](book/part04-algorithmic-toolbox.asc)
   </details>
   <details>
     <summary>
-      Master the most popular sorting algorithms (merge sort, quicksort, insertion sort, etc.)
+      Master the most popular sorting algorithms (merge sort, quicksort, etc.) <i>(Click to expand)</i>
     </summary>
 
 ---
@@ -453,7 +452,7 @@ and then discuss efficient sorting algorithms O(n log n) such as:
   </details>
   <details>
     <summary>
-      Learn different approaches to solve problems such as divide and conquer, dynamic programming, greedy algorithms, and backtracking.
+      Learn different approaches to solve problems such as divide and conquer, dynamic programming, greedy algorithms, and backtracking. <i>(Click to expand)</i>
     </summary>
 
 ---
@@ -475,7 +474,7 @@ We are going to discuss the following techniques for solving algorithms problems
 ## FAQ
 
 <details>
-    <summary>How would I apply these to my day-to-day work?</summary>
+    <summary>How would I apply these to my day-to-day work? <i>(Click to expand)</i></summary>
     <p>
     As a programmer, we have to solve problems every day. If you want to solve problems well, then it's good to know about a broad range of solutions. A lot of times, it's more efficient to learn existing resources than stumble upon the answer yourself. The more tools and practice you have, the better. This book helps you understand the tradeoffs among data structures and reason about algorithms performance.
     </p>
@@ -507,11 +506,11 @@ This project is also available in a [book](https://books.adrianmejia.com/dsajs-d
 
 Reach out to me at one of the following places!
 
-- Twitter at <a href="http://twitter.com/amejiarosario" target="_blank">`@amejiarosario`</a>
+- Twitter at <a href="http://twitter.com/iAmAdrianMejia" target="_blank">`@iAmAdrianMejia`</a>
 - Chat on <a href="https://dsajs-slackin.herokuapp.com" target="_blank">`dsajs.slack.com`</a>
 
 ## License
 
 [![License](https://img.shields.io/:license-mit-blue.svg?style=flat-square)](LICENSE)
 
-![](https://data.uxeranalytics.com/image1.png?uxa=github-dsajs)
+<!-- ![](https://data.uxeranalytics.com/image1.png?uxa=github-dsajs) -->

benchmarks/array-rotation-implementations/01-array-rotation.js

@@ -0,0 +1,9 @@
+// brute force: O(nd) | O(1)
+function rotLeft(a, d) {
+  for (let i = 0; i < d; i++) { // O(d)
+    a.push(a.shift()); // O(n), shift O(n)
+  }
+  return a;
+}
+
+module.exports = rotLeft;

benchmarks/array-rotation-implementations/01a-array-rotation.js

@@ -0,0 +1,11 @@
+// modulus for rotations: O(n^2) | O(1)
+function rotLeft(a, d) {
+  const len = a.length;
+  const rot = d % len;
+  for (let i = 0; i < rot; i++) { // O(n^2)
+    a.push(a.shift()); // O(n)
+  }
+  return a;
+}
+
+module.exports = rotLeft;

benchmarks/array-rotation-implementations/02-array-rotation.js

@@ -0,0 +1,12 @@
+// additional space: O(n) | O(n)
+function rotLeft(a, d) {
+  const len = a.length;
+  const rot = d % len;
+  const b = [];
+  for (let i = 0; i < len; i++) { // O(n)
+    b[i] = a[(rot + i) % len]; // O(1)
+  }
+  return b;
+}
+
+module.exports = rotLeft;

benchmarks/array-rotation-implementations/array-rotation.spec.js

@@ -0,0 +1,17 @@
+/*eslint-disable */
+// npx jest benchmarks/two-sum-implementations/two-sum.spec.js --watch --collectCoverage
+const implementations = [
+  { name: 1, fn: require('./01-array-rotation') },
+  { name: '1a', fn: require('./01a-array-rotation') },
+  { name: 2, fn: require('./02-array-rotation') },
+];
+
+implementations.forEach(({name, fn}) => {
+  describe(`Two Sum: ${name}`, () => {
+    it('should work on worst case', () => {
+      const rots = 1000;
+      const array = [1, 2, 3];
+      expect(fn(array, rots)).toEqual([2,3,1]);
+    });
+  });
+});

benchmarks/two-sum-implementations/01-two-sum.js

@@ -0,0 +1,13 @@
+// Brute force: O(n^2) | O(1)
+function twoSum(nums, target) {
+  for (let i = 0; i < nums.length - 1; i++) { // O(n^2)
+    for (let j = i + 1; j < nums.length; j++) { // O(n)
+      if (nums[i] + nums[j] === target) {
+        return [i, j];
+      }
+    }
+  }
+  return [];
+}
+
+module.exports = twoSum;

benchmarks/two-sum-implementations/01a-two-sum.js

@@ -0,0 +1,13 @@
+// Brute force: O(n^2) | O(1)
+function twoSum(nums, target) {
+  for (let i = 0; i < nums.length - 1; i++) { // O(n^2)
+    const diff = target - nums[i];
+    const offset = i + 1;
+    const idx = nums.slice(offset).findIndex((n) => n === diff); // O(n)
+    const j = offset + idx;
+    if (idx > -1) return [i, j];
+  }
+  return [];
+}
+
+module.exports = twoSum;