Skip to content

Latest commit

 

History

History
52 lines (42 loc) · 1.5 KB

notes.md

File metadata and controls

52 lines (42 loc) · 1.5 KB

Roadmap

  • PDF: callouts and emojis are not showing correctly
  • Writeup on balancing trees
  • BinaryTree implementation on its own. So far, we only have BST.
  • TreeSet should be able to store objects. Does it need a comparator? on BST in case node's values are not just numbers but also objects.
  • Refactor LinkedList.remove(). It's doing to much maybe it can be refactor in terms of removeByPosition and indexOf
  • More algorithm and datastructres! Greedy, Divide and Conquer etc.
  • Algorithms visualizations like https://bost.ocks.org/mike/algorithms/
  • sorting algorithms needs a comparator. So, it can sort objects as well. Replace Array.sort for mergesort in src/algorithms/knapsack-fractional.js

Troubleshooting

Some notes while working on this project

Tests

Running one test without changing file

jest -t '#findNodeAndParent'

Running one test changing code

it.only('should return with an element and its parent', () => {
// ...
});

English Words

Getting some (200k+) English words are useful for testing and benchmarking.

cat /usr/share/dict/words > benchmarks/dict.txt

ESLint

Disabling ESLints

somthing(t) =>  1  // eslint-disable-line no-unused-vars
// eslint-disable-next-line no-use-before-define
const  thing  =  new Thing();

/*eslint-disable */
//suppress all warnings between comments
alert('foo');
/*eslint-enable */

/* eslint-disable no-alert, no-console */
alert('foo');
console.log('bar');
/* eslint-enable no-alert */