Skip to content

Instantly share code, notes, and snippets.

View arjunrao87's full-sized avatar
πŸ‘‹

Arjun Rao arjunrao87

πŸ‘‹
View GitHub Profile
@arjunrao87
arjunrao87 / tls.md
Created September 2, 2017 18:45
Enable TLS on Digital Ocean
@arjunrao87
arjunrao87 / startup-resources.md
Last active July 17, 2017 03:19
Starting up - Resources
@arjunrao87
arjunrao87 / website.md
Last active January 24, 2017 02:52
Jekyll commands

Serve local

bundle exec jekyll serve

Export from wordpress

ruby -rubygems -e 'require "jekyll-import";
    JekyllImport::Importers::WordpressDotCom.run({
 "source" => "../wp-import/strengthandhonor.wordpress.2017-01-24.xml",
@arjunrao87
arjunrao87 / React101.md
Last active November 15, 2016 02:17
Starting with React

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

Round 1

>> Main installation

  1. React {To build the V and C components of the web app}
  2. Redux {To handle state for JS apps, React for me} ( Flux )
  3. 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 )
@arjunrao87
arjunrao87 / Catalan.java
Created February 22, 2015 12:11
Catalan number
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++){
@arjunrao87
arjunrao87 / InsertionSort.java
Last active August 29, 2015 14:14
Insertion sort
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);
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 );
}