Interview Question


Country: United States
Interview Type: Phone Interview




Comment hidden because of low score. Click to expand.
0
of 0 vote

public static String reorder(String s){
		
		char[] arr = s.toCharArray();
		HashMap<Character, MyChar> map = new HashMap<Character, MyChar>();
		TreeSet<MyChar> set = new TreeSet<MyChar>();
		for(char c:arr){
			MyChar my_c = map.get(c);
			if(my_c == null){
				my_c = new MyChar(c,0);
				map.put(c, my_c);
			}
			set.remove(my_c);
			my_c.count++;
			set.add(my_c);
			
		}
		
		MyChar prev = null;
		for(int i =0; i<arr.length;++i){
			if(set.size() == 0){
				System.out.println("n"+i);
				return "no solution found";
			}
			MyChar curr = set.last();
			set.remove(curr);
			curr.count--;
			arr[i]=curr.c;
			if(prev!=null && prev.count>0){
			    set.add(prev);
			}
			prev = curr;
		}
		return String.valueOf(arr);
	}

public class MyChar implements Comparable {

	public char c;
	public int count;

	public MyChar(char c, int count) {
		this.c = c;
		this.count = count;
	}

	@Override
	public int compareTo(Object arg0) {
		// TODO Auto-generated method stub
		int res = count-((MyChar)arg0).count;
		if(res != 0) {
			return res;
		}
		return ((MyChar)arg0).c-c;
	}

}

- Anonymous October 10, 2015 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

public class MyChar implements Comparable {

	public char c;
	public int count;

	public MyChar(char c, int count) {
		this.c = c;
		this.count = count;
	}

	@Override
	public int compareTo(Object arg0) {
		// TODO Auto-generated method stub
		int res = count-((MyChar)arg0).count;
		if(res != 0) {
			return res;
		}
		return ((MyChar)arg0).c-c;
	}

}
public static String reorder(String s){
		
		char[] arr = s.toCharArray();
		HashMap<Character, MyChar> map = new HashMap<Character, MyChar>();
		TreeSet<MyChar> set = new TreeSet<MyChar>();
		for(char c:arr){
			MyChar my_c = map.get(c);
			if(my_c == null){
				my_c = new MyChar(c,0);
				map.put(c, my_c);
			}
			set.remove(my_c);
			my_c.count++;
			set.add(my_c);
			
		}
		
		MyChar prev = null;
		for(int i =0; i<arr.length;++i){
			if(set.size() == 0){
				System.out.println("n"+i);
				return "no solution found";
			}
			MyChar curr = set.last();
			set.remove(curr);
			curr.count--;
			arr[i]=curr.c;
			if(prev!=null && prev.count>0){
			    set.add(prev);
			}
			prev = curr;
		}
		return String.valueOf(arr);
	}

- Amsh October 10, 2015 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More