shadabahmed’s gists

shadabahmed / skip_list.rb

Created June 10, 2018 15:54

Skip List Ruby Implementation

	INFINITY = 1.0 / 0
	NEG_INFINITY = -1.0 / 0

	class Node
	MAX_LEVEL = 7
	# node has value and levels
	attr_accessor :val, :levels
	def initialize(val)
	self.val = val
	self.levels = []

shadabahmed / aggrobot.rb

Created October 1, 2014 05:47

Aggrobot Example


	=begin

	{
	"region1": {month1: {avg_target: xxx, avg_actual: xxx}
	month2: .........
	}

	=end

shadabahmed / logstash-cert.sh

Last active July 31, 2017 05:56

Lumberjack - init.d and config files. Copy the init.d script to /etc/init.d/lumberjack and add execute permissions. Copy the config file lumberjack to /etc/default/lumberjack file.

	# Create Key
	openssl genrsa -des3 -out logstash.key 1024
	sudo openssl genrsa -des3 -out logstash.key 1024
	# Create CSR
	openssl req -new -key logstash.key -out logstash.csr
	sudo openssl req -new -key logstash.key -out logstash.csr
	# Remove password from key
	sudo openssl rsa -in logstash.key.org -out logstash.key
	# Create certificate
	sudo openssl x509 -req -days 365 -in logstash.csr -signkey server.key -out logstash.crt

shadabahmed / logstash-suse

Last active March 16, 2017 18:19

Logstash init.d script and config file. Ubuntu script is borrowed from http://www.vmdoh.com/blog/centralizing-logs-lumberjack-logstash-and-elasticsearch SuSe script is for SLES. Just copy the script to /etc/init.d as logstash

	#! /bin/sh
	### BEGIN INIT INFO
	# Provides: logstash
	# Required-Start: $remote_fs $syslog
	# Required-Stop: $remote_fs $syslog
	# Default-Start: 2 3 4 5
	# Default-Stop: 0 1 6
	# Short-Description: Start daemon at boot time
	# Description: Enable service provided by daemon.
	### END INIT INFO

shadabahmed / skyline_tree.rb

Created April 23, 2013 04:59

	class SkylineTree
	attr_reader :root

	def initialize(node_class = Node, start = nil, value = nil)
	@node_class = node_class
	@root = start && tree_type.new(start, value)
	end

	def add(range, value = nil)
	if root

shadabahmed / index.html

Created April 19, 2013 09:43

A CodePen by Shadab Ahmed. Soduko Solver - Simple sudoko solver where we have atleast one unambigous cell all the time when solving the puzzle

	<section>
	<table class="grid">
	<tbody>
	<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td>
	<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td>
	<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td>
	<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td>
	<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td>
	<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td>
	<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td>

shadabahmed / index.html

Created April 18, 2013 17:38

A CodePen by Shadab Ahmed.

	<section>
	<table class="grid">
	<colgroup><col><col><col>
	<colgroup><col><col><col>
	<colgroup><col><col><col>
	<tbody>
	<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td>
	<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td>
	<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td>
	<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td>

shadabahmed / parens_permute.rb

Last active December 16, 2015 04:59

A tree for creating parenthesis permutation

	require 'graphviz'

	class LeveledBinaryTree
	Node = Struct.new(:weight, :str, :left, :right)

	attr_accessor :levels, :root

	def initialize(clear_last_level = true)
	@root = Node.new(1, '(')
	@levels = {0 => [@root]}

shadabahmed / index.html

Created March 23, 2013 12:48

A CodePen by Shadab Ahmed.

	<div class="rumor">
	<div class="dropdown">
	<label>Algorithm:</label>
	<select id="algo">
	</select>

	<label>Number of People:</label>
	<input id="count" type="text" value="60" name="count"/>
	<label>Speed:</label>
	<select name="speed" id="speed">

shadabahmed / range_count_tree.rb

Last active December 14, 2015 17:38

Range Count Tree For problems like given n ranges, find the interval when maximum ranges intersect

	# RangeCountTree
	# A bst variant for fast retrieval of count of ranges which are intersecting given n ranges
	#
	# Creator : Shadab Ahmed
	#
	# Each node stores a range and the count of intervals which intersect with the range.
	#
	# We just follow these rules:
	# 1. Any range which is greater than the current range is stored in the right subtree
	# 2. Any range which is smaller than the current range is stored in the left subtree

Shadab Ahmed shadabahmed