Amazon Interview Question
Country: India
I'd like to point out that while code is nice (especially if it's tested, working code), it is important to include an English-language description of algorithms because reading code can be tedious.
I'd like to point out that while code is nice (especially if it's tested, working code), it is important to include an English-language description of algorithms because reading code can be tedious.
is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
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.
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.
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.
#include<conio.h>
- Hector December 17, 2011#include<stdio.h>
struct node
{
int data;
struct node*link;
};
void push(struct node**,int);
int get_min(struct node**top);
// void pop();
int main()
{
struct node*st;
int n;
st=NULL;
push(&st,8);
push(&st,7);
push(&st,6);
push(&st,5);
push(&st,3);
n= get_min(&st);
printf("%d",n);
getch();
}
int get_min(struct node**top)
{
struct node*temp,*next;
temp=*top;
while(temp!=NULL)
{
next=temp->link;
if(temp->data<next->data)
{
next->data=temp->data;
}
temp=temp->link;
}
return temp->data;
}
void push(struct node **p,int num)
{
struct node*temp;
temp=(struct node*)malloc(sizeof(struct node));
if(temp==NULL)
{
printf("stack is full");
}
temp->data=num;
temp->link=*p;
*p=temp;
}