unknown Interview Question for Software Engineer / Developers


Country: United States




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

public String lexicoGraphicallylly(String str) {

HashMap<Character, Integer> countChar = new HashMap<>();

for (int i = 0; i < str.length(); i++) {

if (countChar.get(str.charAt(i)) == null) {

countChar.put(str.charAt(i), 1);

} else {
int count = countChar.get(str.charAt(i));

countChar.put(str.charAt(i), count + 1);
}

}
StringBuffer test = new StringBuffer();
char ch = 0;


// Get the least character from the string and its count..
for (char alphabet = 'A'; alphabet <= 'Z'; alphabet++) {

if (countChar.get(alphabet) != null) {
ch = alphabet;

break;
}

}

for (int i = 0; i < countChar.get(ch); i++) {
test.append(ch);

}

String test1 = str.replaceAll(Character.toString(ch), "");
return test.append(test1).toString();

}

- Ashokkumar S.Angadi September 18, 2016 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

public String lexicoGraphicallylly(String str) {

		HashMap<Character, Integer> countChar = new HashMap<>();

		for (int i = 0; i < str.length(); i++) {

			if (countChar.get(str.charAt(i)) == null) {

				countChar.put(str.charAt(i), 1);

			} else {
				int count = countChar.get(str.charAt(i));

				countChar.put(str.charAt(i), count + 1);
			}

		}
		StringBuffer test = new StringBuffer();
		char ch = 0;

		
		// Get the least character from the string and its count..
		for (char alphabet = 'A'; alphabet <= 'Z'; alphabet++) {

			if (countChar.get(alphabet) != null) {
				ch = alphabet;

				break;
			}

		}

		for (int i = 0; i < countChar.get(ch); i++) {
			test.append(ch);

		}

		String test1 = str.replaceAll(Character.toString(ch), "");
		return test.append(test1).toString();

}

- Ashokkumar S.Angadi September 18, 2016 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

public String lexicoGraphicallylly(String str) {

		HashMap<Character, Integer> countChar = new HashMap<>();

		for (int i = 0; i < str.length(); i++) {

			if (countChar.get(str.charAt(i)) == null) {

				countChar.put(str.charAt(i), 1);

			} else {
				int count = countChar.get(str.charAt(i));

				countChar.put(str.charAt(i), count + 1);
			}

		}
		StringBuffer test = new StringBuffer();
		char ch = 0;

		
		// Get the least character from the string and its count..
		for (char alphabet = 'A'; alphabet <= 'Z'; alphabet++) {

			if (countChar.get(alphabet) != null) {
				ch = alphabet;

				break;
			}

		}

		for (int i = 0; i < countChar.get(ch); i++) {
			test.append(ch);

		}

		String test1 = str.replaceAll(Character.toString(ch), "");
		return test.append(test1).toString();

	}

- ashokkumarangadi September 18, 2016 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

o0-o0

- opo November 11, 2016 | 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