Hey Varun,
can you elaborate about the interview process a bit more.. like how many
rounds are there.. and what to expect in each round. What to focus on
mainly.. It would be of great help.
Thanks
Mitaksh Gupta
On Sat, Sep 8, 2012 at 4:24 PM, varun singh varun2004si...@gmail.comwrote
the o/p will be 2 not 1 because of the post-increment operator.
On Sun, Jul 8, 2012 at 10:23 PM, rahul sharma rahul23111...@gmail.comwrote:
int i=5;
i=++i/i++;
print i;
i=1
how?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
First verify that the graph doesnt have the cycles using BELLMAN-FORD
ALGORITHM. then apply DFS.. this will certainly give you a right answer...
On Thu, Feb 23, 2012 at 10:01 AM, atul anand atul.87fri...@gmail.comwrote:
@saurabh :Even if you are considering its as a graph with no cycles , you
