Hewlett Packard Interview Question for Software Engineer / Developers


Team: Networking
Country: United States
Interview Type: In-Person




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

Simple java solution

public int returnCount(String subject, int test) {
     if(null == subject || subject.length() == 0 || test == 0) return -1; //edge cases
     int matchingCounts = 0;
     String[] items = subject.split(" ")
     for(String item : items) {
       if(item.length() == test) {
          matchingCounts++
       }
     }
     return matchingCounts;

}

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

asdf

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

String a="i am in love with new york";
String b[]=a.split(" ");
for(int i=0;i<b.length;i++){
if(b[i].length()==2){
String k=b[i];
System.out.println(k.length());
break;
}}

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

{{
String a="i am in love with new york";
String b[]=a.split(" ");
for(int i=0;i<b.length;i++){
if(b[i].length()==2){
String k=b[i];
System.out.println(k.length());
break;
}}

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

public class FirstProblem {


public static void main(String arg[])
{
String a="i am in love with new york";
String b[]=a.split(" ");
for(int i=0;i<b.length;i++){
if(b[i].length()==2){
String k=b[i];
System.out.println(k.length());
break;
}}







}}

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

public class Test {
    private String WORD = "I am in love with New York";
    private int count = 0;
    private char[] chars = new char[5];

    public void read() {
        concat(getChar(2));
        concat(getChar(3));
        concat(' ');
        concat(getChar(5));
        concat(getChar(6));
        System.out.print(String.copyValueOf(chars));

    }

    private void concat(char letter) {
        chars[count] = letter;
        count++;
    }

    private char getChar(int position) {
        return WORD.charAt(position);
    }

- brasil November 12, 2015 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

#include<stdio.h>
#include<string.h>
int main()
{
	char str[100],ch,flag=0;
	int count=0,word=0;
	int i=0;
	printf("enter string");
	gets(str);
	while(str[i++]!='\0')
	{
		if(str[i]==' ')
		{
			if(count==2)
			word++;
			count=0;
		}		
		else
		count++;
	}
	printf("%d",word);
}

- apoorva December 23, 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