Maturu Srinivas Phani Ram phaniram

phaniram / Picking_cards.java

Created January 8, 2012 13:38

Interview Street Challenges - Picking_cards

	package interviewstreet;

	import java.util.HashMap;
	import java.util.Scanner;

	public class Picking_cards {

	int num;
	int[] card_nums;
	HashMap<Integer,Integer> hm=new HashMap<Integer,Integer>();

phaniram / Permutation.java

Created January 8, 2012 11:41

Interview Street Challenges - Permutation

phaniram / Direct_conn.java

Created January 8, 2012 10:22

Interview Street Challenges - Direct conn

phaniram / abcd.java

Created January 7, 2012 16:23

quora_fraud

phaniram / Permutation.java

Created January 7, 2012 16:22

temp

phaniram / Vertical_sticks.java

Created January 6, 2012 18:32

Interview Street Challenges(Using threads) - Vertical Sticks



	import java.util.ArrayList;
	import java.util.Arrays;
	import java.util.List;
	import java.util.Scanner;
	import java.util.concurrent.Callable;
	import java.util.concurrent.ExecutionException;
	import java.util.concurrent.ExecutorService;
	import java.util.concurrent.Executors;

phaniram / Vertical_sticks.java

Created January 5, 2012 15:35

Interview Street Challenges - Vertical Sticks


	import java.util.*;

	public class Vertical_sticks {

	public boolean permute(int[] data) {
	int k = data.length - 2;
	while (data[k] >= data[k + 1]) {
	k--;
	if (k < 0) {

phaniram / Permutations.java

Created January 5, 2012 02:24

Unique Permutations of an int[]

	public class Permutations {

	public static boolean permuteLexically(int[] data) {
	int k = data.length - 2;
	while (data[k] >= data[k + 1]) {
	k--;
	if (k < 0) {
	return false;
	}
	}

phaniram / k_diff.java

Created January 3, 2012 10:33

Interview Street Challenges - K Difference(Optimized)

	package com.interviewstreet.puzzles;

	import java.util.Arrays;
	import java.util.Scanner;
	/**
	*
	* @author cypronmaya
	* K Difference - Interviewstreet Challenges (Optimal Solution)
	*/
	public class k_diff {

phaniram / find_str.java

Created January 3, 2012 10:32

Interview Street Challenges - Find Strings

	package com.interviewstreet.puzzles;

	import java.util.ArrayList;
	import java.util.Scanner;
	import java.util.TreeSet;

	public class find_str {

	private static final String INVALID = "INVALID";
	private TreeSet<String> mainset = new TreeSet<String>();