speed and time mangement were only hurdle.
On Thu, Mar 29, 2012 at 1:24 AM, Aman Goyal aman.goya...@gmail.com wrote:
10 multiple choice questions on C : very easy , Kanetkar will suffice.
Aptitude : subjective , with mostly mathematical puzzles . Lengthy due to
time consuming problems. Focus
are you sure u want to ask BINARY SEARCH treees and not Binary trees..
On 1/29/12, Moheed Moheed Ahmad mohe...@gmail.com wrote:
I know how to solve it programatically, can anybody pls help me to solve it
using combinatorics.
-Moheed
--
You received this message because you are subscribed to
i didn't got .. !! please explain some more..
On 2/7/12, sumit mahamuni sumit143smail...@gmail.com wrote:
Hello,
Here you are right about variable p in add function that it retains it's
value even though function loses its scope. And for main function error you
are seeing has nothing to do
@^ : We are just going to do a BFS kind of thing is crawler, its
better to use a bqueue/b for implementing it.
rest to store it , we can use accordingly like if we have just to
store the URL we can use a pretty simple DS like arrays, or say
Linklists(if its very large) .
but if we need to store
int main ()
{
int g= 1, h= 2;
int t; t=g;g=h;h=t;
}
hope this helps
On 2/4/12, rahul sharma rahul23111...@gmail.com wrote:
swap(a,b,c) c t;t=a;a=b;b=t;
int main()
{
int g=1,h=2;
swap(g,h,int);
}
how the actual values are replace???
a and b are replaced with g and hactual are
can use a ternary tree kind of datastructure where each node will
contain a pointer to the next character, It's better than trie becoz
at each node rather than storing all 26 english characters or say 255
characters we only store the possible characters to the next level.
Now to get the possible
distance;
}
.
hope this helps
On 2/1/12, atul anand atul.87fri...@gmail.com wrote:
@Manni : didnt get your algo for upward nodes.
On Wed, Feb 1, 2012 at 2:30 PM, Manni mbd mbd2...@gmail.com wrote:
^same as above..
for upward.. start again from the nodes now distance is distance is
(distance
^same as above..
for upward.. start again from the nodes now distance is distance is
(distance of start node -k) .. if you reach this from the root.. print
it..
also better is we use array rather than using linked list .. as
sorting can be a tedious task in case of link lists !
On 2/1/12, atul
@Manee: can u explain a bit more !! still unclear
On 1/30/12, Manee mani.ma...@gmail.com wrote:
store all the indices wherever the value decreases. all subsequences
between 0, these indices and the end index n are increasing
subsequences.
Check which of these are of length K.
On Jan 26,
