aaani’s gists

aaani / gist:8c80400eb49cf5d41445229162e48b6a

Created September 13, 2016 23:11

	body {
	background-color: green;
	}

aaani / gist:5e2fec2dde85d4f8619c22a361c83558

Created September 13, 2016 23:10

	body {
	background-color: red;
	}

aaani / get_xhr.js

Created August 16, 2014 06:52

Pure javascript module to send an ajax get request. It works well on IE8+ and other modern browsers.

	var GetXHR = (function() {
	var module = {};

	module.sendRequest = function(url, callback) {
	var req;

	if (window.XDomainRequest) {
	req = new XDomainRequest();
	if (!req) return;
	req.onload = function(){

aaani / maxLenSubstring2Chars.cpp

Created November 12, 2013 15:49

Details: http://codingdragon.tumblr.com/post/66782834831/longest-2-character-substring

	pair<pair<char,char>,int> maxLenSubstring2Chars(string s){
	pair<char,int> lastChar;
	lastChar.first=s[0];
	lastChar.second=1;

	pair<pair<char,char>,int> longestPairYet;
	longestPairYet.second=-1;

	pair<pair<char,char>,int> currentPair;
	currentPair.first.first=s[0];

aaani / MaxPossibleSum.cpp

Created November 2, 2013 16:03

Details: http://codingdragon.tumblr.com/post/65793702921/optimal-strategy-for-a-game

	#include <iostream>
	#include <vector>
	using namespace std;

	int Max(int a, int b){
	return a>b?a:b;
	}

	int Min(int a, int b){
	return a<b?a:b;

aaani / MultiStack.cpp

Last active December 26, 2015 18:49

	#include <iostream>
	#include <stack>
	#include <vector>
	using namespace std;


	class SetOfStacks{
	vector<stack<int>> stacks;
	int threshold;

aaani / RotateMatrix.cpp

Last active December 26, 2015 13:19

Details: http://codingdragon.tumblr.com/post/65055120905/rotate-matrix-by-90-degrees

	template<int N>
	void rotate90Clockwise(int (&matrix)[N][N]){
	//Transpose the matrix
	int temp;
	for(int i=0;i<N;i++){
	for(int j=0;j<i;j++){
	temp=matrix[i][j];
	matrix[i][j]=matrix[j][i];
	matrix[j][i]=temp;
	}

aaani / FindSortedShifted.cpp

Created October 24, 2013 19:18

Details: http://codingdragon.tumblr.com/post/64975458402/find-a-key-in-circularly-shifted-sorted-array

	int find(vector<int> elements, int start, int end, int key){
	if(start>end) return -1;

	int mid = start + (end-start)/2;
	if(elements[mid]==key) return mid;

	if(elements[mid]>=elements[start]){
	if(key>=elements[start] && key<elements[mid]) return find(elements,start,mid-1,key);
	else return find(elements,mid+1,end,key);
	}else{

aaani / LongestCommonPrefix.cpp

Last active December 26, 2015 10:09

	int LCPLength(vector<string> input){

	//Find the length of shortest string in the input set
	int minLen = INT32_MAX;
	for(int i=0;i<input.size();i++){
	if(input[i].length()<minLen) minLen=(int)input[i].length();
	}

	bool done = false;
	int lcpLen=0;

aaani / MergeSort.java

Last active December 21, 2015 17:08

Here is a Java implementation of merge sort. This algorithms runs in O(n*log(n)) worst case time and O(n) space, where n is the input size. It's a stable sort, commonly used in sorting from disk.

	import java.util.ArrayList;

	/**
	*
	* @author anirvana
	*/
	public class MergeSort {

	public static void main(String[] args) {
	ArrayList<Integer> elements=new ArrayList<Integer>();

Ani Mishra aaani