Interview Experiences

Interview Questions

Latest Interview Questions

Common Interview Questions

See Books for recommended books on interview preparation.

# Company Wise Coding Practice    Topic Wise Coding Practice

• close man

• close man

a lot of interview questions and answer is available in in different tropics:

http://cybarlab.com/category/interview

• anju

refer this too

http://bit.ly/1biTdXo

• Recent Engineer

hey can any one tell me how to get a job off-campus in good companies ?
I am currently in BE 2014 appearing

• ANUJ

In case if there is no campus placement for you…Plan for CDAC(Only bangalore or pune center) There placement is superb

• tariq

give elitmus test, u will get a chance for interview in good companies.

• Rustam Hussain

can u solve ?? read file and count the frequency of word and print along with in dec order

• Rustam Hussain

plz solve

Create a trie of the words.

• yy

dfddrfdgtryyyyyyyyyyyyy

• narendra

There was a question asked where you have to print 3rd largest palindrome word found in a sentence. If there are only two or one palindrome print those.

here is the code

```
#code is in python

var = raw_input(&quot;enter a sentence: &quot;)

listl=[]

for word in var.split(' '):

if word==word[::-1]:

listl.append(word)

listl=sorted(listl, key=len, reverse=True)

if len(listl)&gt;=3:

print &quot;third largest pailendrom is: &quot;, listl[2]

if len(listl)==2:

print &quot;first two pailendroms are : &quot;, listl[0], listl[1]

if len(listl)==1:

print &quot;There is only one pailendrom : &quot;, listl[0]

if len(listl)==0:

print &quot;There is no pailendrom in the sentence: &quot;

```
• naman

list[2] is not the third largest palindrome its just the 3rd palimdrome in the list

• placement jump

want to know how amazon and microsoft conduct their technical placement test?
http://placementjump.blogspot.in/2013/08/want-to-know-from-where-amazon-prepare.html

• #include
#include

int n;
void MAX_HEAPIFY(int [],int);
int LEFT(int);
int RIGHT(int);
void HEAP_SORT(int []);
void main()
{
int heap[50],i,j,temp;
extern int n;

clrscr();

printf(“\n Enter the no of Elements of the heap:-“);
scanf(“%d”,&n);
j=n;
printf(“\n Enter the Elements of the heap one by one:-“);
for(i=1;i=1;i–)
{
MAX_HEAPIFY(heap,i);
}
printf(“\n After heapifying:-“);
for(i=1;i<=n;i++)
printf("\t %d",heap[i]);

HEAP_SORT(heap);

printf("\n After Sorting:-");
for(i=1;i<=j;i++)
printf("\t %d",heap[i]);

getch();
}

void MAX_HEAPIFY(int heap[],int i)
{
int l,r,largest,temp;
l=LEFT(i);
r=RIGHT(i);

if(lheap[i])
largest=l;
else
largest=i;

if(rheap[largest])
largest=r;

if(largest!= i)
{
temp=heap[i];
heap[i]=heap[largest];
heap[largest]=temp;
MAX_HEAPIFY(heap,largest);
}
}
int LEFT(int i)
{
return(2*i);
}

int RIGHT(int i)
{
return(2*i+1);
}

void HEAP_SORT(int heap[])
{
int temp,last;

while(n>1)
{
temp=heap[1];
heap[1]=heap[n];
heap[n]=temp;
n–;
MAX_HEAPIFY(heap,1);
}
}

• vicky123
``` ```
/* Paste your code here (You may delete these lines if not writing code) */
``` ```