another-guy/problem-solving-ts

# Problem Solving in TypeScript


| Build Status – Travis CI | Maintainability | Code Coverage | Documentation |
| ---------------- | ------------------ | ------------------- | ------------------- | 
| [![Build Status](https://travis-ci.org/another-guy/problem-solving-ts.svg?branch=master)](https://travis-ci.org/another-guy/problem-solving-ts)  | [![bitHound Overall Score](https://www.bithound.io/github/another-guy/problem-solving-ts/badges/score.svg)](https://www.bithound.io/github/another-guy/problem-solving-ts) [![bitHound Code](https://www.bithound.io/github/another-guy/problem-solving-ts/badges/code.svg)](https://www.bithound.io/github/another-guy/problem-solving-ts) [![Maintainability](https://api.codeclimate.com/v1/badges/0a3a7953a4d9cf89673a/maintainability)](https://codeclimate.com/github/another-guy/problem-solving-ts/maintainability) | [![Coverage Status](https://coveralls.io/repos/github/another-guy/problem-solving-ts/badge.svg?branch=master)](https://coveralls.io/github/another-guy/problem-solving-ts?branch=master) [![Test Coverage](https://api.codeclimate.com/v1/badges/0a3a7953a4d9cf89673a/test_coverage)](https://codeclimate.com/github/another-guy/problem-solving-ts/test_coverage) | [![Inline docs](http://inch-ci.org/github/another-guy/problem-solving-ts.svg?branch=master)](http://inch-ci.org/github/another-guy/problem-solving-ts) |

| License | Liberapay | Repo hit count |
| ------------------- | ------------------- | ------------------- |
| [![MIT license](http://img.shields.io/badge/license-MIT-brightgreen.svg)](http://opensource.org/licenses/MIT) | [![Liberapay](https://img.shields.io/liberapay/patrons/another-guy.svg)](https://www.bithound.io/github/another-guy/problem-solving-ts) | [![HitCount](http://hits.dwyl.com/another-guy/problem-solving-ts.svg)](http://hits.dwyl.com/another-guy/problem-solving-ts) |


## Table of Contents

1. CodinGame
    * Easy
        * Chuck Norris (message encoding)
1. Cracking the Coding Interview
    * 1 TODO
    * 2 TODO
    * 3 Stacks and Queues
        * 3.1 [MultiStack](https://github.com/another-guy/problem-solving-ts/blob/master/src/cracking-the-coding-interview/3-stacks-and-queues/3-1-single-array-multiple-stacks.cr.md). [[Code Review]](https://codereview.stackexchange.com/questions/194051/multiple-stacks-implemented-via-a-linked-lists-on-top-of-single-fixed-size-array)
    * 4 Graphs
        * 4.1 Existence of path between nodes
    * 5 Bit Manipulation
        * 5.0 [Bitwise Operations Cheat Sheet](https://github.com/another-guy/problem-solving-ts/blob/master/src/cracking-the-coding-interview/5-bit-manipulation/5-0-cheat-sheet.md)
        * 5.1 Insert one bit sequence into another
        * 5.3 [Flip bit to win](https://github.com/another-guy/problem-solving-ts/blob/master/src/cracking-the-coding-interview/5-bit-manipulation/5-3-flip-to-win.cr.md). [[Code Review]](https://codereview.stackexchange.com/questions/194733/find-the-longest-length-of-sequence-of-1-bits-achievable-by-flipping-a-single-bi)
    * 6 Math and Logic Puzzles
        * 6.2 Basketball
    * 7 TODO
    * 8 Recursion and Dynamic Programming
        * 8.1 Triple step (non-recursive)
        * 8.2 Robot on a grid (recursive and non-recursive). [[Code Review]](https://codereview.stackexchange.com/questions/194979/robot-on-a-grid-find-a-path-between-two-corners-with-forbidden-cells-on-the-roa)
        * 8.3 Magic index (recursive).
1. Leet Code
   * 1 Two Sum
1. Practice
    * [Candidate algorithms](https://github.com/another-guy/problem-solving-ts/blob/master/src/practice/0-0-candidate-algorithms.md)
    * 1 Graph
        * 1.1 TopSort (Topological Sorting)
        * 1.2 Dijkstra's shortest path
        * 1.3 Prim's minimal spanning tree
    * 9 Naive (hashtable-based) PriorityQueue