- Backup decision maker files
- Get commands to stop Decision Maker ( The One ) and then restart it. Including nginx, docker etc.
- Stop Decision Maker, Nginx
- Run command - "
- Go to Digital Ocean portal and enable IPv6
- In the portal, power the droplet back on
- Restart Nginx, Decision Maker
- Follow the steps for TLS https://www.digitalocean.com/community/tutorials/how-to-secure-nginx-with-let-s-encrypt-on-ubuntu-16-04
Venture Hacks - http://venturehacks.com/
Startup Resources - http://startupresources.io/
Startup School - https://www.startupschool.org/
Venture Capital And Funding Rounds -
Intro to Blockchain - https://bitsonblocks.net/2015/09/09/a-gentle-introduction-to-blockchain-technology/
Immutability of Blockchains - https://bitsonblocks.net/2016/02/29/a-gentle-introduction-to-immutability-of-blockchains/
Pros and cons of internal blockchains - https://bitsonblocks.net/2015/12/01/the-pros-and-cons-of-internal-blockchains/
10/15/2016 Getting started with ReactJS. The stack seems to be what I have shown below ( for the moment ). The values in paranthesis "()" is the 'competition', the values in brackets "{}" is the usage reason
>> Main installation
- React {To build the V and C components of the web app}
- Redux {To handle state for JS apps, React for me} ( Flux )
- Webpack{ To do module bundling so that all the dependent JS libraries arent in separate files. One of the main advantages is code splitting which means only the parts that are actually going to be loaded get pulled in chunks or code blocks at run time. ( browserify )
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| public class CatalanNumber { | |
| public static void main( String[] args ){ | |
| System.out.println( countTrees( 17) ); | |
| } | |
| static long countTrees(int numkeys){ | |
| if(numkeys>1){ | |
| long sum=0; | |
| for(int i= 1; i <=numkeys; i++){ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package sort; | |
| import java.util.Arrays; | |
| public class InsertionSort { | |
| public static void main( String[] args ){ | |
| InsertionSort sort = new InsertionSort(); | |
| int[] arr = {5,4,3,1,2}; | |
| arr = sort.sort(arr); |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| public static LNode _head; | |
| public BSTNode convert( LNode head ){ | |
| _head = head; | |
| int len = count( head ); | |
| if( len == 0 ){ | |
| return null; | |
| } | |
| return convert( 0, len - 1 ); | |
| } |