nsivabalan

public class FindSetBits {
	
	public static int getTotalSetBits(byte[] b, int offset, int endIndex)
	{
		int size = b.length;
		length = endIndex - offset;
		if(offset > size*8) throw new IllegalArgumentException("Offset overflow");
		if((offset + length )> size*8) throw new IllegalArgumentException("Offset overflow");
		
		int startIndex = offset;

nsivabalan

import java.util.Comparator;
import java.util.Iterator;
import java.util.PriorityQueue;
import java.util.Queue;


/**
KDTrees. Used to find KNearestNeighbour among N Points in a KD Plane in O(logK) time.
Here is the implementation of 2D tress to find K nearest neighbours for any point among N given points.
Run time complexity : O((N+k)logK). 

nsivabalan

package facebook.onlinequiz;

import java.io.InputStreamReader;
import java.io.IOException;
import java.io.BufferedReader;
import java.util.StringTokenizer;

public class Solution {

	int totalTests = 0;

nsivabalan

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

public class RetrieveShuffledSentence {
	
	static ArrayList<String> origDictWords ;
	static Map<String, String> dictMap;
	public static void populateDictionary(String[] dict)
	{

nsivabalan

public class TextJustification {

	
	
	public static void justifyText(String[] words, int width)
	{
		if(words == null || words.length == 0) return ;
		//checkForIllegalArgs(words, width) TO DO
		
		int start = 0;

nsivabalan

public class TextJustification {

	public static void justifyText(String[] words, int width)
	{
		if(words == null || words.length == 0) return ;
		//checkForIllegalArgs(words, width)

		int start = 0;
		int end = 0;
		int wordLen = words.length;

nsivabalan

public class NoStarveReaderWriterLock {
	private final Semaphore readMutex = new Semaphore(1);
	private final Semaphore writeMutex = new Semaphore(1);
	private final Semaphore noStarveMutex = new Semaphore(1);
	private final Set<Long> readerIds = Collections
			.synchronizedSet(new HashSet<Long>());
	private volatile Long writerId;
 
	public void readLock() {
		try {

nsivabalan

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;

public class LuckyStrings {

	public static void main(String args[]) throws NumberFormatException, IOException
	{

nsivabalan

/**
 * Class used for scrubbing the log for any inconsistencies
 */
public class Scrubber {

  /**
   * Used to start scrubbing the log for consistency checks
   */
  public void start();

nsivabalan

import com.github.ambry.clustermap.PartitionId;
import com.github.ambry.config.StoreConfig;
import com.github.ambry.store.BlobStore;
import com.github.ambry.utils.Time;
import java.util.Map;
import java.util.concurrent.Executors;
import java.util.concurrent.ScheduledExecutorService;
import java.util.concurrent.ThreadLocalRandom;
import java.util.concurrent.TimeUnit;