another-guy/problem-solving-ts

View on GitHub
Branch: master(View all)
NameLines of codeMaintainabilityTest coverage
.codeclimate.json
.editorconfig
.gitignore
.npmignore
.travis.yml
CODE_OF_CONDUCT.md
CONTRIBUTING.md
LICENSE
README.md
package.json
src/codility/trim-long-message.ts21
A
1 hr
src/coding-game/1-easy/chuck-norris.ts38
A
25 mins
src/cracking-the-coding-interview/3-stacks-and-queues/3-1-single-array-multiple-stacks.cr.md
src/cracking-the-coding-interview/3-stacks-and-queues/3-1-single-array-multiple-stacks.ts127
B
6 hrs
src/cracking-the-coding-interview/4-graphs/4-1-path-between-nodes-exists.ts18
A
25 mins
src/cracking-the-coding-interview/5-bit-manipulation/5-0-cheat-sheet.md
src/cracking-the-coding-interview/5-bit-manipulation/5-1-insert-m-into-n.ts10
A
0 mins
src/cracking-the-coding-interview/5-bit-manipulation/5-3-flip-to-win.cr.md
src/cracking-the-coding-interview/5-bit-manipulation/5-3-flip-to-win.ts34
A
0 mins
src/cracking-the-coding-interview/6-math-and-logic-puzzles/6-2-basketball.md
src/cracking-the-coding-interview/8-recursion-and-dynamic-programming/8-1-triple-step.ts19
A
1 hr
src/cracking-the-coding-interview/8-recursion-and-dynamic-programming/8-2-robot-in-a-grid.ts88
C
7 hrs
src/cracking-the-coding-interview/8-recursion-and-dynamic-programming/8-3-magic-index.ts13
A
1 hr
src/hired/1-1-n-th-largest-number-in-array.ts25
A
0 mins
src/hired/1-2-number-of-ways-to-jump-to-n-th-step.ts39
A
45 mins
src/index.ts0
A
0 mins
src/leet-code/1-easy/1-two-sum.ts30
A
1 hr
src/leet-code/1-easy/13-roman-to-integer.ts47
A
3 hrs
src/practice/0-0-candidate-algorithms.md
src/practice/0-directed-graph.ts4
A
0 mins
src/practice/0-priority-queue.ts6
A
0 mins
src/practice/0-undirected-graph.ts23
A
1 hr
src/practice/1-1-top-sort.ts64
A
1 hr
src/practice/1-2-dijkstra-shortest-path.ts85
A
1 hr
src/practice/1-3-prim-minimal-spaning-tree.ts33
A
0 mins
src/practice/9-1-dummy-priority-queue.ts39
A
0 mins
tsconfig.json
tslint.json
yarn.lock