aaani

import java.util.*;

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

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

aaani

body {
    background-color: green;
}

aaani

body {
    background-color: red;
}

aaani

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

#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

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


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

aaani

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

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

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

import java.util.ArrayList;

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

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