Forum Posts
- 5 Answers Google Interview process for Enterprise Software developer
Hi, Recently I had a phone interview with google for enterprise app developer role in NY. The phone interview wasn't hard in comparison with the questions posted in the internet for google interviews. So out of curiosity I asked the interviewer about the role. He replied that Enterprise App developer role is quite different from their Software Engineer role. And he said that the interview process would be less of Algorithm/ DS and more of JEE framework and design. Since then I have been preparing for it. But I am not finding many google interview questions for JEE framework / design. Now that I have explained my situation, here are my questions.
- post2scr December 22, 2012
<b>
1) Is there someone out there who has gone thro' the interview process for Enterprise App developer with google? If so, please give me some tips and point me to the right resource for my preparation.
2) To the Careercup team, would you please shed some light on the difference between the interview process for Enterprise App Developer and s/w engg role ?
</b>
Note: my onsite interview is in couple of weeks.
Appreciate your responses.| Flag | PURGE - 2 Answers Motivation for Internship
In the Internship application forms, how to write the answers for following questions :
- azeemyou December 22, 2012
what do you hope to achieve by this internship?
What is your interest in this programme?
What is the motivation for your application? etc
please help me| Flag | PURGE - 3 Answers Stress before the interview
Hi,
- martin.konicek@commercetools.de December 21, 2012
so I prepared well for an on-site interview but couldn't get a good sleep due to being nervous. I ended up doing quite poorly because of the lack of sleep.
Now I'm waiting for the result. I really cared about this interview. Do you think I should tell my recruiter about the situation or would it be regarded as unprofessional?
Thank you. And watch out for being nervous! Either calm yourself down somehow (convince yourself it's not a big deal, which I couldn't), or have sleeping pills ready just in case.| Flag | PURGE - 0 Answers How to partition an array
There is some problem in the following code that seeks to partition the array (the first element taken as pivot). Please help me fix the issue.
- ashutosh December 19, 2012
#include<stdio.h>
#include<conio.h>
int partition(int [],int,int);
main()
{
int a[20],n,i;
printf("enter the number of elements in the array\n");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("enter the number\n");
scanf("%d",a+i);
}
printf("the index of the pivot is %d and the partitioned array is\n",partition(a,0,n-1));
for(i=0;i<n;i++) printf("%d\t",a+i);
getch();
}
int partition(int a[],int lower,int upper)
{
int p=a[lower];
int i=lower,j=upper+1,temp;
do
{ do{i++;}while(a[i]<=p);
do{j--;}while(a[j]>=p);
if(i<j){ temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}while(i>=j);
a[lower]=a[j];
a[j]=p;
return j;
}| Flag | PURGE - 0 Answers problem with divide and conquer approach to find max-min in an array
Can anyone help me fix the problem with the code for finding max-min in an array?
- ashutosh December 19, 2012
#include<stdio.h>
#include<conio.h>
maxmin(int,int,int,int);
int num[20],max,min,max1,min1;
main()
{ int n,i;
printf("enter number of elements in the array\n");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("enter the number\n");
scanf("%d",&num[i]);
}
maxmin(0,n-1,max,min);
printf("the maximum element is- %d\n",max);
printf("the minimum element is- %d\n",min);
getch();
}
maxmin(int i,int j,int max,int min)
{
if(i=j) max=min=num[i];
else if(j=i+1) { if(num[i]<num[j]) { max=num[j]; min=num[i];}
else if(num[i]>num[j]){max=num[i]; min=num[j];}
else max=min=num[i];
}
else
{
int mid=(i+j)/2;
maxmin(i,mid,max,min);
maxmin(mid+1,j,max1,min1);
}
if(max<max1) max=max1;
if(min>min1) min=min1;
}| Flag | PURGE - 0 Answers finding repeated elements in an array using randomized algorithm
Given an array of size n having n/2 distinct and the rest identical elements ,write a C program to find the repeated one using randomized algorithm.
- ashutosh December 19, 2012
I have written the code but it has some problem at rum time and stops.
Can anyone help please?
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
int repeated(int [],int);
main()
{ int n,i;
int *num;
printf("enter the number of elements in the array\n");
scanf("%d",&n);
num=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
printf("enter the number\n");
scanf("%d",num+i);
}
printf("the repeated element is %d\n",repeated(num,n));
getch();
}
int repeated(int num[],int n)
{ int i,j;
while(1)
{
i=rand()%n;
j=rand()%n;
if((i!=j)&&(num[i]==num[j])) return num[i];
}
}| Flag | PURGE - 2 Answers Internship
Does a GPA of 3.33 mean getting an internship will be very difficult?
- vaidyasmriti December 18, 2012| Flag | PURGE - 0 Answers Carrer Switch after 1.5 yr experience in Consulting
what about switching from a domain which is more about consulting in finance and trading applications like ENDUR. I have a strong desire to work in a core technical domain like C. i have good programing skills and want to upgrade even better to match the expectation.
- bhupendra December 16, 2012
How much my work experience will affect in making the switch?| Flag | PURGE - 3 Answers Did I failed in the bloomberg onsite interview? Need help!
Hi all,
- Luiz December 15, 2012
I had a onsite interview with bloomberg yesterday. It was pretty long, around 3.5 hours. I had three rounds. First, 2:1 with some technical questions. Second, another 2:1 with technical questions. The third round is with a senior manager I think. He asked some questions about my resume and some behavior questions.
My biggest concern is that I didn't have a meetting with the HR. Does that mean I failed in the manager interview? I am very worried now and so anxious to know. Thank you very much!
Luiz| Flag | PURGE - 0 Answers please solve this question
Many programming languages implement scope for variables – and they are context sensitive. For example a global scope variable will be over-ridden using local variable definition. You need to implement simple interpreter which tells us current value of a variable, if its not defined then value should be zero, Input will start with ‘[‘ and will end with matching ‘]’
- jat.prakash December 15, 2012| Flag | PURGE - 2 Answers carrer switch
Hi all,
- naveenkonda89 December 12, 2012
I am currently working in .NET technology, but I wanted to switch to c, c++
My dream is to get an offer from companies like Adode, Google, Microsoft, Amazon etc.,
I have strong command on C and C++ but I don't have real time project experience but very passionate about working in c, c++, data structures and algorithms.
Will these companies look for prior experience in c, c++ or having good command over them with no prior work experience help in getting an offer from Software giants like these?
Please throw some light.| Flag | PURGE - 1 Answer Implement Doubly linked list using single pointer...
Explain how to implement doubly linked lists using only one pointer value x.np per
- Rahul December 10, 2012
item instead of the usual two (next and prev). Assume that all pointer values can be
interpreted as k-bit integers, and define x.np to be x:np D x:next XOR x:pre,
the k-bit “exclusive-or” of x.next and x.prev. (The value NIL is represented by 0.)
Be sure to describe what information you need to access the head of the list. Show
how to implement the SEARCH, INSERT, and DELETE operations on such a list.
Also show how to reverse such a list in O(1) time.| Flag | PURGE - 0 Answers C++ Topic : Related to 'Multiset' functionality
Consider this sample piece of code!
multiset<int> iends; multiset<int>::iterator et1; while(et1!=iends.end()){ multiset<int>::iterator te=et1; et1++; iends.erase(te); } while(et1!=iends.end()){ multiset<int>::iterator te=et1; iends.erase(te); et1++; }
What is the difference between this two pieces of code?
- Psycho December 09, 2012| Flag | PURGE - 2 Answers common ansestor
I have the book Cracking the Coding Interview Fourth eddition. I have a question about the solution to problem 4.6 (Find first common ansestor of two nodes in a binary tree). The solution ends up suggesting some round about way to see if both nodes are on the same side of a given node and what not. It's pretty confusing. But why not just do a depth first search for each of the nodes. Once node is found, record the path back to the root as the recurstion stack unwids. What's the advantage of the complicatd solution offered by your book over this?
- octane.power December 09, 2012| Flag | PURGE - 6 Answers Use of advanced data structures on a Google interview
Hi,
- commercial.eddie December 08, 2012
My friend has recently interviewed with Google. During one of the on-site interviews he was given the following question:
On a Cartesian coordinate system we draw a Bar chart. You can assume that the height of each bar is a natural value. Give an algorithm finding the rectangle of maximum area, bound by the diagram and the x axis. With n being the number of bars, you should do significantly better than O(n^2).
My friend was unable to answer this question, and after we analyzed it at home the only way we could find for meeting the time complexity requirements, is to use a k-d tree\Interval tree data structure for keeping coordinates. These are not basic data structures; They're nearly never discussed during undergraduate studies, and the careercup book doesn't cover this type of questions. Is there a trivial solution we've been missing? Or is it that if I ever interview with Google I should expected to be asked on topics I don't have a chance to be prepared for? This is not what "Cracking the coding interview" is implying.
Please share your thoughts. 10x.| Flag | PURGE