Given a STL map, say mapint, bool m1. Given two value a b that may or
may not exists in m1. Find the Least Common Ancestor in STL MAP. Remember
you don't have access to root, so you need to iterate using iterator. Use
the methods/function of MAP forex begin, end, find etc. Solution should be
.*
On Tue, Oct 9, 2012 at 9:47 AM, Avinash Mishra
mishra.avinas...@gmail.comwrote:
Hello any one have idea about Flipkart recruitment process for SDE1.
Please guide me what to prepare.
Thanks
--
regard's
Avinash
--
You received this message because you are subscribed
Hello any one have idea about Flipkart recruitment process for SDE1. Please
guide me what to prepare.
Thanks
--
regard's
Avinash
--
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.
--
aviNash
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
aviNash
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
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.
--
With Regard's
Avinash
--
You
/-/2YdFa0ZwOIsJ.
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.
--
With regard's
Avinash
--
You received
this group at
http://groups.google.com/group/algogeeks?hl=en.
--
With Regard's
Avinash Mishra
--
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
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.
--
aviNash
--
You received this message because
://groups.google.com/group/algogeeks?hl=en.
--
aviNash
--
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
Some how I found that we need to run bfs twice to get the largest distance
between any two nodes of a tree. Please explain me how it works.
regards,
avinash
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web
at 2:44 PM, Avinash jain.av...@gmail.com wrote:
Some how I found that we need to run bfs twice to get the largest
distance between any two nodes of a tree. Please explain me how it works.
regards,
avinash
--
You received this message because you are subscribed to the Google
Groups
5
/ \ \
6 7 8
/ \ \
9 a b
so from a-b is
a-7-4-2-5-8-b
On Sat, Jun 23, 2012 at 2:44 PM, Avinash jain.av...@gmail.com wrote:
Some how I found that we need to run bfs twice to get the largest
distance between any two nodes of a tree. Please explain me how it works
#include stdio.h
void main()
{
while(1)
{
int opt;
scanf(%d,opt);
printf(%d\n,opt);
}
}
when i execute this program, if i give a character instead of an integer, it
goes into an infinite loop. why is it so?
--
You received this message because you are
That would work dheerjaj. Only thing is links reassignment should be taken
care of.
On Wed, Aug 31, 2011 at 10:40 AM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
remove the 'n' nodes from the beginning..push in the stack..pop them up and
insert at the end of linked list..till the stack
@dave i was saying if user input a .. he can enter aintmax then how
to detect overflow?
--
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
@Saurabh being ready to run your code for unsatisfactory input doesn't
seem more logical than trying to find out if you can do something
about it. i would have loved a kind reply from you.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
@dave if number a is entered exceeding limit(already overflowed) then
a goes negative(if a was entred just more than limit ) /a goes
positive (if a was entred sufficiently more than limit ) maxint -a=b
concept fails
Avinash Katiyar
NIT Allahabad
--
You received this message because you
@dave i was saying if user enter a+b in which aintmax .. A goes
negative(if a sligtly intmax) a+b =no overflow which we know
shouldnt be an answer..
On 8/28/11, Dave dave_and_da...@juno.com wrote:
@Kunal: You are very kind.
Dave
On Aug 27, 12:58 pm, Kunal Patil kp101...@gmail.com wrote:
++ is simply post increment will increment after use
so *s is printed in first printf.. precedence doesnt matter coz its a
single operand on which post increment has to be done also no copncept
of associativity i think associativity is for same precedence
operators ..
Avinash
NIT allahabad
Written- computer test with around 30 question with 4 options. They
ask question on c- string operations (like strcpy, strstr etc), file
system, binary tree, linked list, function pointer, array, malloc,
free, structure, printf, scanf etc etc... all you need to solve. focus
on these things in fact
Pointer incrementation and subtraction are done in terms of memory blocks
and not addresses of memory.
For example,
int *p;
p++;
The pointer here jumps to the next integer location and not the next address
in memory.
Similarly,pointer subtraction will give the difference in indexes and not
the
On Fri, Aug 12, 2011 at 11:55 AM, Avinash Dharan avinashdha...@gmail.comwrote:
Pointer incrementation and subtraction are done in terms of memory blocks
and not addresses of memory.
For example,
int *p;
p++;
The pointer here jumps to the next integer location and not the next
address
http://stevekrenzel.com/articles/longest-palnidrome
But for some reason it is failing for string ISAAS, may be my
understanding is incorrect.
Thanks
Avinash
http://avi-programming-blog.blogspot.com/
On Jun 21, 11:31 pm, Swathi chukka.swa...@gmail.com wrote:
Does any one know how to return
I second them. Python would be my choice.
On Wed, Mar 16, 2011 at 10:18 AM, pacific pacific pacific4...@gmail.comwrote:
I vote for python.
On Wed, Mar 16, 2011 at 10:03 AM, kracekumar ramaraju
kracethekingma...@gmail.com wrote:
Hello
Python vs Perl been battle for more than 20
to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Avinash Dubey
+91-7799562235
--
You received
to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Avinash Dubey
MNNIT
-- Forwarded message --
From: Dhruva Sagar dhruva.sa...@gmail.com
Date: Tue, Jun 2, 2009 at 4:23 PM
Subject: [algogeeks] Re:
To: algogeeks@googlegroups.com
Yea!
You could confirm from the excel sheet...This place is not for such jokes
Thanks Regards,
Dhruva Sagar.
George
28 matches
Mail list logo
