ishankhare07

def shuffle(number)
  ret_arr = []
  f = fact(number.to_s.size)
  count = 0
  while count < f/2 do
    if count == 0
      ret_arr.push(number)
      ret_arr.push(number.to_s.reverse.to_i)
    else
      num_arr = number.to_s.split(//)

ishankhare07

{0=>7,
 1=>1436615004374.0,
 9=>26,
 2=>
  [{0=>9,
    1=>1436615004217.0,
    2=>
     [{12=>"process_incoming_request",
       13=>"Rbkit::Server#process_incoming_request",
       6=>"/Users/ishan/Desktop/rbkit/lib/rbkit/server.rb",

ishankhare07

//function pointer

fn foo(x: i32) -> i32 {
    return x+1;
}

fn main() {
    let mut x: fn(i32) -> i32 = foo;
    // or x = foo;
    println!("{}", x(10));

ishankhare07

ishankhare07

tmux cheat sheet

(C-x means ctrl+x, M-x means alt+x)

Prefix key

The default prefix is C-b. If you (or your muscle memory) prefer C-a, you need to add this to ~/.tmux.conf:

remap prefix to Control + a

ishankhare07

class Node:
    def __init__(self, num):
        self.data   = num
        self.left   = None
        self.right  = None

root = None

def add_to_tree(element, root):
    if root == None:

ishankhare07

#include "stdio.h"
#include "stdlib.h"
#define size(x) ({ \
            sizeof(x) / sizeof(int); \
        })

int main(void) {
    int input[] = {4, -10, 2, -2, -7, 3, -3, 5, -4, -5, 1, -9, 0, -6, -1, -8};
    int *i, *neg, *pos;
    int *separators[2];         // pointer to a 2x(not yet know size) array

ishankhare07

ishankhare07

Erlang for beginners

• Why erlang?
• Why Use Erlang?
• When would you choose Erlang?
• Erlang: For an absolute beginner
• An Erlang OTP tutorial for beginners
• A Beginners Guide to Erlang
• What is the best way to learn Erlang?
• The Joy of Erlang; Or, How To Ride A Toruk

ishankhare07

from random import shuffle

def merge(left, right, r_list=[]):
    if not left and not right:
        return r_list
    elif not left:
        r = right[0]
        r_list.append(r)
        return merge(left, right[1:], r_list)
    elif not right: