Adobe Interview Question for SDE1s


Country: India




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

// ZoomBA
def classify( string ){
   // please do some menial work and list all consonants, to ensure that 
   // we do not false miss stuff not in [a-z]
   // =~ is the matches operator 
   if ( string =~ '.*[^aeiou]{5,}.*|.*[aeiou]{3,}.*' ) return 'bad'
   if ( string =~ '.*[\?aeiou]{3,}.*|.*(\?|[^aeiou]){5,}.*' ) return 'mixed'
   return 'good'
}

This is very lazy, using regex, and bad matching on them. But generally gives you the idea.
The fall back *order* is essential.

- NoOne October 12, 2016 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

/**
* Created by kr.abhishek on 10/12/2016.
*/


import java.util.Arrays;
import java.util.Scanner;

public class ArrayTest {

public static void main (String [] args)
{
int a[][] = {{1,92,43,4,5},{234,341,56}};
int b=a.length;
for (int i=0;i<a.length; i++)
{
Arrays.sort(a[i]);
for (int j=0;j<a[i].length;j++)
{
System.out.println(a[i][j]);
}
}
System.out.println("value of legth of a is:"+b);

Scanner scanner = new Scanner(System.in);

System.out.println("enter any string to know its type or enter Q to quit");

String str=null;

do {
str = scanner.nextLine();
System.out.println("the string "+str+"type is "+ stringtest(str));
}
while (!"Q".equals(str));

}


public static String stringtest(String s)
{
int vowelcnt=0;
int conscnt=0;
int qvcnt =0;
int qccnt=0;
String strtype;

for(int i=0;i<s.length();i++) {
if (checkvowel(s.charAt(i)) && s.charAt(i) != '?') {
vowelcnt++;
conscnt = 0;
if (vowelcnt == 3)
break;
}

if (checkconsonant(s.charAt(i)) && s.charAt(i) != '?') {
conscnt++;
vowelcnt = 0;

if (conscnt == 5)
break;
}

if (s.charAt(i) == '?') {
if (vowelcnt == 0 && conscnt == 0) {
while (s.charAt(++i) == '?' && i < s.length() - 1) {
System.out.println("inside while");
}
System.out.println("value of i at exit:" + i);
if (i >= 2) {
return "Mixed";
}
if (checkconsonant(s.charAt(i))) {
qccnt++;
conscnt++;
}
if (checkvowel(s.charAt(i))) {
qvcnt++;
vowelcnt++;
}
}

if (vowelcnt > 0) {
qvcnt++;
vowelcnt++;
if (i < s.length() - 1) {
i++;
if (checkvowel(s.charAt(i))||s.charAt(i)=='?') {
qvcnt++;
vowelcnt++;
}
if (checkconsonant(s.charAt(i))) {
qccnt++;
conscnt++;
}

}
}

if (conscnt > 0) {
qccnt++;
conscnt++;
if (i < s.length() - 1) {
i++;
if (checkconsonant(s.charAt(i))||s.charAt(i)=='?') {
qccnt++;
conscnt++;
}
if (checkvowel(s.charAt(i))) {
qvcnt++;
vowelcnt++;
}

}
}

}
if (conscnt == 5) {
if (qccnt > 0)
strtype = "MIxed";
else
strtype = "Bad";
return strtype;
}

if (vowelcnt == 3) {
if (qvcnt > 0)
strtype = "MIxed";
else
strtype = "Bad";
return strtype;
}
}

strtype="Good";

return strtype;}



public static boolean checkvowel(char c)
{
return (c=='a'||c=='e'||c=='i'||c=='o'||c=='u');
}

public static boolean checkconsonant(char c)
{
return (c=='b'||c=='c'||c=='d'||c=='f'||c=='g'||c=='h'||c=='j'||c=='k'||c=='l'||c=='m'||c=='n'||c=='p'||c=='q'||c=='r'||c=='s'||c=='t'||c=='v'||c=='w'||c=='x'||c=='y'||c=='z');
}
}

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

/**
 * Created by kr.abhishek on 10/12/2016.
 */


import java.util.Arrays;
import java.util.Scanner;

public class ArrayTest {

    public static void main (String [] args)
    {
        int a[][] = {{1,92,43,4,5},{234,341,56}};
        int b=a.length;
        for (int i=0;i<a.length; i++)
        {
            Arrays.sort(a[i]);
            for (int j=0;j<a[i].length;j++)
            {
                System.out.println(a[i][j]);
            }
        }
        System.out.println("value of legth of a is:"+b);

       Scanner scanner = new Scanner(System.in);

        System.out.println("enter any string to know its type or enter Q to quit");

        String str=null;

        do {
           str = scanner.nextLine();
            System.out.println("the string "+str+"type is "+ stringtest(str));
       }
        while (!"Q".equals(str));

    }


    public static String stringtest(String s)
    {
        int vowelcnt=0;
        int conscnt=0;
         int qvcnt =0;
         int qccnt=0;
         String strtype;

        for(int i=0;i<s.length();i++) {
            if (checkvowel(s.charAt(i)) && s.charAt(i) != '?') {
                vowelcnt++;
                conscnt = 0;
                if (vowelcnt == 3)
                    break;
            }

            if (checkconsonant(s.charAt(i)) && s.charAt(i) != '?') {
                conscnt++;
                vowelcnt = 0;

                if (conscnt == 5)
                    break;
            }

            if (s.charAt(i) == '?') {
                if (vowelcnt == 0 && conscnt == 0) {
                    while (s.charAt(++i) == '?' && i < s.length() - 1) {
                        System.out.println("inside while");
                    }
                    System.out.println("value of i at exit:" + i);
                    if (i >= 2) {
                        return "Mixed";
                    }
                    if (checkconsonant(s.charAt(i))) {
                        qccnt++;
                        conscnt++;
                    }
                    if (checkvowel(s.charAt(i))) {
                        qvcnt++;
                        vowelcnt++;
                    }
                }

                if (vowelcnt > 0) {
                     qvcnt++;
                    vowelcnt++;
                    if (i < s.length() - 1) {
                        i++;
                        if (checkvowel(s.charAt(i))||s.charAt(i)=='?') {
                            qvcnt++;
                            vowelcnt++;
                        }
                        if (checkconsonant(s.charAt(i))) {
                            qccnt++;
                            conscnt++;
                        }

                    }
                }

                if (conscnt > 0) {
                    qccnt++;
                    conscnt++;
                    if (i < s.length() - 1) {
                        i++;
                        if (checkconsonant(s.charAt(i))||s.charAt(i)=='?') {
                            qccnt++;
                            conscnt++;
                        }
                        if (checkvowel(s.charAt(i))) {
                            qvcnt++;
                            vowelcnt++;
                        }

                    }
                }

            }
            if (conscnt == 5) {
                if (qccnt > 0)
                    strtype = "MIxed";
                else
                    strtype = "Bad";
                return strtype;
            }

            if (vowelcnt == 3) {
                if (qvcnt > 0)
                    strtype = "MIxed";
                else
                    strtype = "Bad";
                return strtype;
            }
        }

        strtype="Good";

        return strtype;}



    public static boolean  checkvowel(char c)
    {
        return (c=='a'||c=='e'||c=='i'||c=='o'||c=='u');
    }

    public static boolean  checkconsonant(char c)
    {
        return (c=='b'||c=='c'||c=='d'||c=='f'||c=='g'||c=='h'||c=='j'||c=='k'||c=='l'||c=='m'||c=='n'||c=='p'||c=='q'||c=='r'||c=='s'||c=='t'||c=='v'||c=='w'||c=='x'||c=='y'||c=='z');
    }
}

- akumarfun October 13, 2016 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Below is the implementation in C++

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <locale>

using namespace std;

enum StrType { GOOD, BAD, MIXED };

bool isChar(char c)
{
  if(c >= 'a' && c <= 'z')
    return true;

  return false;
}

bool isVowel(char c)
{
  if(c == 'a' || c == 'e' || c == 'i'
      || c == 'o' || c == 'u')
    return true;
  return false;
}

StrType checkStrType(string str)
{
  int vcnt = 0, vcnt_mixed = 0;
  int ccnt = 0, ccnt_mixed = 0;

  bool mixed = false;

  for_each(str.begin(), str.end(), [](char &x){x = tolower(x);});

  for(int i = 0; i < str.size(); i++){
    if(isChar(str[i])){
      if(isVowel(str[i])){
        vcnt++;
        if(vcnt_mixed > 0)
          vcnt_mixed++;
        ccnt = ccnt_mixed = 0;
      }
      else {
        ccnt++;
        if(ccnt_mixed > 0)
          ccnt_mixed++;
        vcnt = vcnt_mixed = 0;
      }
    }
    else if(str[i] == '?'){
      vcnt_mixed += vcnt + 1;
      ccnt_mixed += ccnt + 1;
      vcnt = ccnt = 0;
    }

    if(vcnt >= 3 || ccnt >= 5)
      return BAD;

    if(vcnt_mixed >= 3 || ccnt_mixed >= 5)
      mixed = true;
  }

  return mixed ? MIXED : GOOD;
}

Here are some test results.

abc : GOOD
abcdefghjkl : BAD
abcd?eg : GOOD
abcd?eij : MIXED
abcd?keij : MIXED
abcd??eij : MIXED
kbd??ej : MIXED
kbd?e? : MIXED
?aa : MIXED
 : GOOD
jk : GOOD

- linuxchain October 13, 2016 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

class test
{

	public static void main(String ar[])
	{
	   String s="dsjg?uoaerfgkahe";
	   String v="aeiou";
	   int vo=0,cons=0,flag1=0,flag2=0;
	   char ch[]=s.toCharArray();
           for(int i=0;i<s.length();i++)
		{
			  if((v.contains(""+ch[i]) || ch[i]=='?')&&i<s.length()-3)
		                {
		                    if((v.contains(""+ch[i+1]) || ch[i+1]=='?') && (v.contains(""+ch[i+2]) || ch[i+2]=='?'))vo=1;
	                            if(ch[i]=='?'|| ch[i+1]=='?'|| ch[i+2]=='?')flag1=1;
		                }
			  if((!v.contains(""+ch[i])||ch[i]=='?')&&i<s.length()-5)
				{
				     if((!v.contains(""+ch[i+1])||ch[i+1]=='?')&&(!v.contains(""+ch[i+2])||ch[i+2]=='?')&&(!v.contains(""+ch[i+3])||ch[i+3]=='?')&&(!v.contains(""+ch[i+4])||ch[i+4]=='?'))
					cons=1;
	                             if(ch[i]=='?'||ch[i+1]=='?'||ch[i+2]=='?'|| ch[i+3]=='?'||ch[i+4]=='?')flag2=2;
				}
	                 
		}

		if(flag1!=0 && flag2!=0)
		     System.out.println("MIXED");
		else if(vo!=0||cons!=0)
		     System.out.println("BAD");
		else
		     System.out.println("GOOD");
         }
}

- Anonymous November 05, 2016 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

class test
{

	public static void main(String ar[])
	{
	   String s="dsjg?uoaerfgkahe";
	   String v="aeiou";
	   int vo=0,cons=0,flag1=0,flag2=0;
	   char ch[]=s.toCharArray();
           for(int i=0;i<s.length();i++)
		{
			  if((v.contains(""+ch[i]) || ch[i]=='?')&&i<s.length()-3)
		                {
		                    if((v.contains(""+ch[i+1]) || ch[i+1]=='?') && (v.contains(""+ch[i+2]) || ch[i+2]=='?'))vo=1;
	                            if(ch[i]=='?'|| ch[i+1]=='?'|| ch[i+2]=='?')flag1=1;
		                }
			  if((!v.contains(""+ch[i])||ch[i]=='?')&&i<s.length()-5)
				{
				     if((!v.contains(""+ch[i+1])||ch[i+1]=='?')&&(!v.contains(""+ch[i+2])||ch[i+2]=='?')&&(!v.contains(""+ch[i+3])||ch[i+3]=='?')&&(!v.contains(""+ch[i+4])||ch[i+4]=='?'))
					cons=1;
	                             if(ch[i]=='?'||ch[i+1]=='?'||ch[i+2]=='?'|| ch[i+3]=='?'||ch[i+4]=='?')flag2=2;
				}
	                 
		}

		if(flag1!=0 && flag2!=0)
		     System.out.println("MIXED");
		else if(vo!=0||cons!=0)
		     System.out.println("BAD");
		else
		     System.out.println("GOOD");
         }
}

- Anonymous November 05, 2016 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Hi, According to this problem, what should be the output for the input - asdacx?aghv?aa

- atul April 15, 2017 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Here's an O(n) time, O(n) space solution.
Basic approach :
Dynamic programming.
For every '?' , we got two options : either fill a consonant , or a vowel and move forward. According to your previous choice, your prefix will change, i.e .
if you fill a consonant, your new function call will have c+1 consonants , and 0 vowels in the last streak.
so the recurrence boils down to two cases.
1. when its not a '?'
classify(startindex, consonants , vowels ) = classify(startindex + 1, consonants +1 , 0)
OR
classify(startindex, consonants , vowels ) = classify(startindex + 1, 0 , vowels + 1)
depending on whether the character at startindex is a consonant or a vowel.

2. when its a '?'
in this case , you need to check both cases, consonant and vowel
let c_val = classify(startindex+1 , consonant+1 , 0)
let v_val = classify(startindex+1 , 0 , vowel+1)

now the answer will be :
- if both c_val and v_val are good, then answer is good
- if both c_val and v_val are bad, then answer is bad
- the answer is mixed in all other cases

Here's the code(C++) :

#include <bits/stdc++.h>

using namespace std;
typedef vector<int> vi;
typedef long long int lli;
typedef vector<lli> vli;

#define GOOD 1
#define BAD -1
#define MIXED 0

bool isvowel(char c)
{
    string s = "aeiou";
    for(char x : s)
    {
        if(c == x)
            return true;
    }
    return false;
}
int substringtype[10000][6][4];
int classify(const string &s , int start = 0 , int c = 0 , int v = 0)
{
    if(c==5 || v==3)
        return BAD;
    if(start == s.size())
        return GOOD;

    if(substringtype[start][c][v] != -1)
    {
        return substringtype[start][c][v];
    }

    if(s[start] != '?')
    {
        if(isvowel(s[start]))
        {
            substringtype[start][c][v] = classify(s , start+1 , 0 ,v+1);
            return substringtype[start][c][v];
        }
        substringtype[start][c][v] = classify(s, start + 1, c+1 , 0);
        return substringtype[start][c][v];
    }

    int c_opt = classify(s, start + 1, c+1 , 0);
    int v_opt = classify(s, start + 1, 0 , v+1);

    if(v_opt == c_opt)
    {
        substringtype[start][c][v] = v_opt;
    }
    else
        substringtype[start][c][v] = MIXED;

    return substringtype[start][c][v];
}

int main()
{
    int i, j, k;
    for(i=0;i<10000;i++)
    {
        for(j=0;j<6;j++)
        {
            for(k=0;k<4;k++)
            {
                substringtype[i][j][k] = -1;
            }
        }
    }
    cout<<classify("ab??bbb")<<endl;

}

- nilanjanalodh September 27, 2017 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

public static string CategorizedString(string s)
{
// if three consecutive Vowels - or five consecutive consonants (alphabets-aeiou - 21 symbols) - bad
// if a?i - sounds bad , aeio? sounds bad
// else good


int vcount = 0;
int ccount = 0;
int vmixed = 0;
int cmixed = 0;

int i = 0;
while (i < s.Length)
{

if (IsVowel(s[i]) || s[i]=='?')
{

if (i == 0)
{
vcount++;
if (s[i] == '?')
vmixed++;
}
if (i > 0)
{
if ((IsVowel(s[i - 1]) || s[i - 1] == '?') && s[i] != '?')
{
vcount++;
ccount = 0;cmixed = 0;
}
if (s[i] == '?')
{
vmixed++;vcount++;
}
}
}
if (IsConsonants(s[i]))
{
if (i == 0)
{
ccount++;
if (s[i] == '?')
cmixed++;
}
if (i > 0)
{
if (IsConsonants(s[i - 1]) && s[i] != '?')
{
ccount++;
vcount = 0;vmixed = 0;
}
if (s[i ] == '?')
{
cmixed++; ccount++;
}
}
}
if ((ccount == 5 && cmixed == 0) || (vcount == 3 && vmixed == 0))
return "bad";
else if ((ccount == 5 && cmixed > 0) || (vcount == 3 && vmixed > 0)) return "mixed";
if (s[i]=='?')
{
// do nothing as we checking it in above scenarios
//continue;
}
i++;
}

return "good";

}

static bool IsVowel(char c)
{
HashSet<char> vowels = new HashSet<char>() { 'a', 'e', 'i', 'o', 'u' };
return vowels.Contains(c);
}

static bool IsConsonants(char c)
{
return !IsVowel(c) ;
}

- Anonymous January 14, 2018 | 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