This repository includes a series of tests that can be used for practicing algorithms in the Javascript and Ruby programming languages.
To get started, just clone this repo with git clone https://github.com/jaysonvirissimo/practice-thy-algorithms.git.
Make sure you have the Yarn package manager installed on your system.
Navigate to the JavaScript directory and run yarn install.
The problem statements are inside the appropriately named file in lib.
This is also where you write your own code.
Run yarn test when you are ready for some feedback on your attempt.
Write your solutions in algorithms.rb and run the rspec command in the Ruby directory.
| Name | JavaScript | Ruby |
|---|---|---|
| Digital Root | x | x |
| Caesar Cipher | x | x |
| Common Substrings | x | x |
| Recursive Sum | x | x |
| Fibonacci Sequence | x | x |
| Palindrome | x | x |
| Valid IP | x | |
| Folding Cipher | x | x |
| Unique Substrings | x | x |
| Largest Contiguous Subsum | x | x |
| Silly Years | x | x |
| Pair Sum | x | x |
| Matrix Region Sum | x | x |
| Merge Sort | x | |
| Binary Search | x | |
| Productify | x | |
| Subsets | x | |
| Longest Palindrome | x | |
| Fast Intersection | x | |
| Common Subsets | x | |
| Can Win | x | |
| Non-Comparison Sorts | x | |
| Weighted Random Index | x | |
| Move Zeros | x | |
| Look and Say | x | |
| Sum Upon Sums | x | |
| Max Stack | x | |
| Stack Queue | x | |
| Windowed Max Range | x | |
| Hash Dictionary | x | |
| Find Missing Number | x | |
| Is Shuffle? | x | |
| Binary | x | |
| Recursive Factorial | x | |
| Iterative Factorial | x | |
| Permutations | x |