[algogeeks] Re: Openings in Amazon

2012-11-27 Thread Pankaj Kumar
Sir, I have sent you my CV on vivekr...@gmail.com. Hope you got that

On Friday, November 23, 2012 9:29:29 PM UTC+5:30, Vivek Ramamurthy wrote:

 Hi,
 Amazon is hiring people for software development projects undergoing at 
 Blore, Hyd and Chennai divisions.There are openings for Software 
 Development Engineer, Software Development Engineer in Test, Application 
 Engineer and for Quality Assurance Engineer positions .Send me your resume 
 if you are interested. 



 -- 
 *Vivek Ramamoorthy,
 *SDE,
 Amazon,
 Chennai.


-- 




[algogeeks] runtime error help

2011-08-14 Thread pankaj kumar
can any one help me why am i getting runtime error in the program.
my program is

def call(a,b):
print(((pow(a,b))%10));
def main():
n=input();
for x in range(n):
import sys
a,b = map(long,sys.stdin.readline().split());
a=a%10;
if((a==0)or(a==1)or(a==5)or(a==6)):
print(a);
if(a==2 or a==7 or a==8 or a==3):
call(a,b%4)
if(b==4 or b==9):
call(a,b%2);


main();

i am solving lastdig2 problem of spoj
http://www.spoj.pl/problems/LASTDIG2/

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



[algogeeks] pankaj kumar wants to chat

2011-08-14 Thread pankaj kumar
---

pankaj kumar wants to stay in better touch using some of Google's coolest new
products.

If you already have Gmail or Google Talk, visit:
http://mail.google.com/mail/b-fec58d8386-f16dcef73c-qIhM6BVo3OJNdgYKy2viERCQNpE
You'll need to click this link to be able to chat with pankaj kumar.

To get Gmail - a free email account from Google with over 2,800 megabytes of
storage - and chat with pankaj kumar, visit:
http://mail.google.com/mail/a-fec58d8386-f16dcef73c-qIhM6BVo3OJNdgYKy2viERCQNpE

Gmail offers:
- Instant messaging right inside Gmail
- Powerful spam protection
- Built-in search for finding your messages and a helpful way of organizing
  emails into conversations
- No pop-up ads or untargeted banners - just text ads and related information
  that are relevant to the content of your messages

All this, and its yours for free. But wait, there's more! By opening a Gmail
account, you also get access to Google Talk, Google's instant messaging
service:

http://www.google.com/talk/

Google Talk offers:
- Web-based chat that you can use anywhere, without a download
- A contact list that's synchronized with your Gmail account
- Free, high quality PC-to-PC voice calls when you download the Google Talk
  client

We're working hard to add new features and make improvements, so we might also
ask for your comments and suggestions periodically. We appreciate your help in
making our products even better!

Thanks,
The Google Team

To learn more about Gmail and Google Talk, visit:
http://mail.google.com/mail/help/about.html
http://www.google.com/talk/about.html

(If clicking the URLs in this message does not work, copy and paste them into
the address bar of your browser).

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



Re: [algogeeks] Re: Link list problem..

2011-08-08 Thread pankaj kumar
if doubly link list then it is possible to insert a new node before the
current pointer.

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



Re: [algogeeks] MICROSOFT INTERVIEW QUESTIONS faced by my frenz nd me

2011-08-08 Thread pankaj kumar
5)program will compile and  ans is
2 3 5 6

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



Re: [algogeeks] amazon test question!!!

2011-08-08 Thread pankaj kumar
what's ans

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



Re: [algogeeks] simple doubt

2011-08-05 Thread pankaj kumar
first one is right and second is wrong.because dp will store address of
pointer and here you are storing address of int array.

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



Re: [algogeeks] Structure Q

2011-08-05 Thread pankaj kumar
head-x=100 is not right
if you will first declare
head=new list;
head-x=100;
will be right.

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



Re: [algogeeks] Re: Duplicates in a string

2011-08-05 Thread pankaj kumar
int b[26]={0};
vectorcharc;
for(i=0;a[i];i++)
{
if(!b[(a[i]-65)])
{
b[(a[i]-65)]++;
c.push_back(a[i]);
}
}
for(i=0;ic.size();i++)
coutc[i];
}

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



Re: [algogeeks] Re: Duplicates in a string

2011-08-05 Thread pankaj kumar
when you encounter the letter for first time then simply increment array
having index=(ASCII value-65)
and put that in vector  next time when you will encounter the same variable
again then condition will fail hence no change in content of vector
 hence in the end simply print the vector

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



Re: [algogeeks] Makemytrip.com

2011-08-05 Thread pankaj kumar
coming for which branch??

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



Re: [algogeeks] Sort IT

2011-08-02 Thread pankaj kumar
int a[N^2]={0},i,j;
for(i=0;iN^2;i++)
{
cinj;
a[j]++;
}

for(i=0;iN^2;i++)
{
if(a[i]!=0)
{
while(a[i]--)
{
couti\t;
}

}

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



Re: [algogeeks] Amazon

2011-07-30 Thread pankaj kumar
what was cutoff cgpa for amazon??



-- 
pankaj kumar

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.