hrishikesh-mishra

/**
 * Test Java Doc
 * @link
 * @see "https://gist.github.com/hrishikesh-mishra/e02f79b0121de4dfe495898fcccd8f84"
 */
public class Test {
    private static int ax;
    private static int px;
}

hrishikesh-mishra

package com.hrishikeshmishra.practices.string;


import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

import static com.hrishikeshmishra.practices.string.GroupAnagrams.getGroup;

hrishikesh-mishra

package com.hrishikeshmishra.practices.sort;

import java.util.Arrays;

import static com.hrishikeshmishra.practices.sort.InversionsCountInArray.getCountByMergeSort;

/**
 * Problem:
 * Inversion Count for an array indicates –
 * how far (or close) the array is from being sorted.

hrishikesh-mishra

package com.hrishikeshmishra.practices.string;

import java.util.Arrays;

import static com.hrishikeshmishra.practices.string.SuffixArray.createSuffixArray;

/**
 * Problem:
 * Suffix Array Implementation (Manber & Myers)
 * Application:

hrishikesh-mishra

package com.hrishikesh.practices.string;

import java.util.ArrayList;
import java.util.List;

/**
 * Problem:
 * Generate possible strings that can be made by placing spaces.
 *
 * @author hrishikesh.mishra

hrishikesh-mishra

package com.hrishikesh.practices.string;

import java.util.Arrays;

/**
 * Problem:
 * Longest Repeated Substring (using Suffix Array)
 *
 * @author hrishikesh.mishra
 */

hrishikesh-mishra

package com.hrishikeshmishra.practices.string;

import java.util.Arrays;

import static com.hrishikeshmishra.practices.string.LexicographicOrder.getNextPermutation;

/**
 * Problem:
 * Lexicographic Order
 * Generates permutations using lexicographic ordering.

hrishikesh-mishra

package com.hrishikeshmishra.practices.sort;

import java.util.Arrays;

/**
 * Problem:
 * Reverse Quick Sort
 * ;
 * Algorithm:
 * - Just Change comparision logic for Quick Sort

hrishikesh-mishra

package com.hrishikeshmishra.practices.sort;

import java.util.Arrays;
import java.util.concurrent.ThreadLocalRandom;

/**
 * Problem:
 * Quick Sort with Randomized Partition
 * ;
 * Algorithm:

hrishikesh-mishra

package com.hrishikesh.practices.sort;

import java.util.Arrays;

/**
 * Problem:
 * Quick Sort With Hoare Partition
 *
 * @author hrishikesh.mishra
 */