Queue with stacks

.eslintignore

@@ -0,0 +1,6 @@
+**/node_modules/*
+**/*.min.js
+**/vendor/*
+**/coverage/*
+**/build/*
+**/docs/*

.eslintrc

@@ -0,0 +1,25 @@
+{
+  "env": {
+    "browser": true,
+    "node": true,
+    "commonjs": true,
+    "jest": true,
+    "es6": true
+  },
+  "globals": {
+    "fail":true
+  },
+  "extends": "eslint:recommended",
+  "parserOptions": {
+    "sourceType": "module",
+    "ecmaVersion": 2018
+  },
+  "rules": {
+    "no-console": "off",
+    "indent": [ "error", 2 ],
+    "quotes": ["error", "single", { "allowTemplateLiterals": true }],
+    "comma-dangle": ["error", "always-multiline"],
+    "semi": [ "error", "always" ],
+    "no-unused-vars": [1, {"vars": "local", "args": "none"}]
+  }
+}

.gitattributes

@@ -0,0 +1,4 @@
+* text=auto
+
+# Align with eslint linebreak-style: [ "error", "unix" ]
+*.js text eol=lf

.gitignore

@@ -0,0 +1,145 @@
+# 401 JS
+db
+.env
+temp
+build
+
+# Created by https://www.gitignore.io/api/vim,osx,node,linux,windows
+### Linux ###
+*~
+
+# temporary files which can be created if a process still has a handle open of a deleted file
+.fuse_hidden*
+
+# KDE directory preferences
+.directory
+
+# Linux trash folder which might appear on any partition or disk
+.Trash-*
+
+# .nfs files are created when an open file is removed but is still being accessed
+.nfs*
+
+### Node ###
+# Logs
+logs
+*.log
+npm-debug.log*
+yarn-debug.log*
+yarn-error.log*
+
+# Runtime data
+pids
+*.pid
+*.seed
+*.pid.lock
+
+# Directory for instrumented libs generated by jscoverage/JSCover
+lib-cov
+
+# Coverage directory used by tools like istanbul
+coverage
+
+# nyc test coverage
+.nyc_output
+
+# Grunt intermediate storage (http://gruntjs.com/creating-plugins#storing-task-files)
+.grunt
+
+# Bower dependency directory (https://bower.io/)
+bower_components
+
+# node-waf configuration
+.lock-wscript
+
+# Compiled binary addons (http://nodejs.org/api/addons.html)
+build/Release
+
+# Dependency directories
+node_modules/
+jspm_packages/
+
+# Typescript v1 declaration files
+typings/
+
+# Optional npm cache directory
+.npm
+
+# Optional eslint cache
+.eslintcache
+
+# Optional REPL history
+.node_repl_history
+
+# Output of 'npm pack'
+*.tgz
+
+# Yarn Integrity file
+.yarn-integrity
+
+# dotenv environment variables file
+.env
+
+
+### OSX ###
+*.DS_Store
+.AppleDouble
+.LSOverride
+
+# Icon must end with two \r
+Icon
+
+# Thumbnails
+._*
+
+# Files that might appear in the root of a volume
+.DocumentRevisions-V100
+.fseventsd
+.Spotlight-V100
+.TemporaryItems
+.Trashes
+.VolumeIcon.icns
+.com.apple.timemachine.donotpresent
+
+# Directories potentially created on remote AFP share
+.AppleDB
+.AppleDesktop
+Network Trash Folder
+Temporary Items
+.apdisk
+
+### Vim ###
+# swap
+[._]*.s[a-v][a-z]
+[._]*.sw[a-p]
+[._]s[a-v][a-z]
+[._]sw[a-p]
+# session
+Session.vim
+# temporary
+.netrwhist
+# auto-generated tag files
+tags
+
+### Windows ###
+# Windows thumbnail cache files
+Thumbs.db
+ehthumbs.db
+ehthumbs_vista.db
+
+# Folder config file
+Desktop.ini
+
+# Recycle Bin used on file shares
+$RECYCLE.BIN/
+
+# Windows Installer files
+*.cab
+*.msi
+*.msm
+*.msp
+
+# Windows shortcuts
+*.lnk
+
+# End of https://www.gitignore.io/api/vim,osx,node,linux,windows

.travis.yml

@@ -0,0 +1,10 @@
+language: node_js
+node_js:
+  - "stable"
+branches:
+  only:
+    - master
+script:
+  - npm run lint
+  - npm test
+

Chalenges/_test_/array-binary-sort.test.js

@@ -0,0 +1,13 @@
+const findIndex = require('../arrayBinarySort/array-binary-sort');
+
+const arr = [1, 2, 3, 4, 5, 6, 7, 8, 9];
+const find = 3;
+
+describe('array tests', () => {
+
+  const result = findIndex(arr, find);
+
+  test('did find array index', () => {
+    expect(result).toBe(2);
+  });
+});

Chalenges/_test_/array-reverse.test.js

@@ -0,0 +1,11 @@
+const reverseArray = require('../arrayRerverse/array-reverse');
+
+const testArr = [1, 2, 3];
+const result = reverseArray(testArr);
+
+describe.skip('array tests', () => {
+
+  test('is array reversed', () => {
+    expect(result).toStrictEqual([3, 2, 1]);
+  });
+});

Chalenges/_test_/array-shift.test.js

@@ -0,0 +1,18 @@
+const array = require('../arrayShift/array-shift');
+
+
+describe('array tests', () => {
+
+  it('is array shifted', () => {
+    const testArr = [2, 3, 4, 5];
+    const result = array.arrayShift(testArr, 1);
+    expect(result).toStrictEqual([1, 2, 3, 4, 5]);
+  });
+
+  it('is array shifted', () => {
+    const testArr = [1, 2, 4, 5];
+    const result = array.arraySplice(testArr, 3);
+    expect(result).toStrictEqual([1, 2, 3, 4, 5]);
+  });
+
+});

Chalenges/_test_/linked-list.test.js

@@ -0,0 +1,143 @@
+const { LinkedList } = require('../linkedList/linked-list');
+const merge = require('../linkedList/zipper-merge');
+
+describe('Does it make linked lists?', () => {
+  it('can make empty', () => {
+    const result = new LinkedList;
+    const expected = {
+      head: null,
+      size: 0,
+    };
+    expect(result).toEqual(expected);
+  });
+  it('insert into linked list', () => {
+    const list = new LinkedList();
+    expect(list.size).toBe(0);
+    list.insert('a test');
+    expect(list.size).toBe(1);
+  });
+  it('can find first node', () => {
+    const list = new LinkedList;
+    list.insert('a test');
+    const result = {
+      data: 'a test',
+      next: null,
+    };
+    expect(list.head).toEqual(result);
+  });
+  it('can put more than one node in order', () => {
+    const list = new LinkedList;
+    list.insert('snap');
+    list.insert('crackle');
+    list.insert('pop');
+    const third = { data: 'snap', next: null };
+    const second = { data: 'crackle', next: third };
+    const first = { data: 'pop', next: second };
+    expect(list.head).toEqual(first);
+    expect(list.head.next).toEqual(second);
+    expect(list.head.next.next).toEqual(third);
+    expect(list.size).toBe(3);
+  });
+  it('can find a thing?', () => {
+    const list = new LinkedList;
+    list.insert('a test');
+    expect(list.includes('a test')).toBe(true);
+  });
+  it('does not find a thing?', () => {
+    const list = new LinkedList;
+    list.insert('a test');
+    expect(list.includes('a bird')).toBe(false);
+  });
+  it('gives list of data', () => {
+    const list = new LinkedList;
+    list.insert('pinky');
+    list.insert('the brain');
+    expect(list.head.data.toString()).toBe('the brain', 'pinky');
+  });
+  it('add at end?', () => {
+    const list = new LinkedList;
+    list.insert('pinky');
+    list.append('the brain');
+    expect(list.head.data.toString()).toBe('pinky', 'the brain');
+  });
+  it('add before target', () => {
+    const list = new LinkedList;
+    list.insert('snap');
+    list.insert('pop');
+    list.insertBefore('snap', 'crackle');
+    const third = { data: 'snap', next: null };
+    const second = { data: 'crackle', next: third };
+    const first = { data: 'pop', next: second };
+    expect(list.head.data).toEqual(first.data);
+    expect(list.head.next.data).toEqual(second.data);
+    expect(list.head.next.next.data).toEqual(third.data);
+    expect(list.size).toBe(3);
+  });
+  it('add after target', () => {
+    const list = new LinkedList;
+    list.insert('snap');
+    list.insert('pop');
+    list.insertAfter('pop', 'crackle');
+    const third = { data: 'snap', next: null };
+    const second = { data: 'crackle', next: third };
+    const first = { data: 'pop', next: second };
+    expect(list.head.data).toEqual(first.data);
+    expect(list.head.next.data).toEqual(second.data);
+    expect(list.head.next.next.data).toEqual(third.data);
+    expect(list.size).toBe(3);
+  });
+  it('should return exception if k not positive and less than or same as list', () => {
+    const list = new LinkedList;
+    list.insert(1);
+    const listTooShort = list.kthFromEnd(1);
+    expect(listTooShort).toBe('exception');
+    list.append(2);
+    const sameAsList = list.kthFromEnd(2);
+    expect(sameAsList).toBe('exception');
+    const negativeK = list.kthFromEnd(-2);
+    expect(negativeK).toBe('exception');
+  });
+  it('should return target val', () => {
+    const list = new LinkedList;
+    list.insert('snap');
+    list.insert('crackle');
+    list.insert('pop');
+    const crackle = list.kthFromEnd(1);
+    expect(crackle).toBe('crackle');
+  });
+  it('can get middle of list', () => {
+    const list = new LinkedList;
+    list.insert('snap');
+    list.insert('crackle');
+    list.insert('pop');
+    const mid = list.findMid();
+    expect(mid).toBe('crackle');
+  });
+  it('zipper merge where lists same length', () => {
+    const list1 = new LinkedList;
+    list1.insert(1);
+    list1.append(3);
+
+    const list2 = new LinkedList;
+    list2.insert(2);
+    list2.append(4);
+
+    merge(list1, list2);
+    let actual = list1.toString();
+    expect(actual).toBe('1, 2, 3, 4');
+  });
+  it('zipper merge where lists diff length', () => {
+    const list1 = new LinkedList;
+    list1.insert(1);
+    list1.append(3);
+    list1.append(5);
+
+    const list2 = new LinkedList;
+    list2.insert(2);
+    list2.append(4);
+
+    merge(list1, list2);
+    let actual = list1.toString();
+    expect(actual).toBe('1, 2, 3, 4, 5');
+  });
+});