check it now ... register your team and engage in codewar ..
--
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
ok got it ..thanks for resolving queries :) :)
On Wed, Feb 22, 2012 at 11:10 AM, sunny agrawal sunny816.i...@gmail.comwrote:
*NO, u r getting it wrong*
*given a value x, we can find how many contiguous sums are lesser than x
using the above mentioned algorithm in O(N)*
*so we are searching a
written test..2-3 simple algorithmss.we have like...count no. of
occcurance of the words occuring more than one...merge to array...n test
cases u have to write 4 somw questions which are quite logical.
On Wed, Feb 22, 2012 at 10:29 AM, Mihir Kulkarni mihirk...@gmail.comwrote:
Hello,
Beware of cycles.
Don
On Feb 22, 6:05 am, krishna kishore kknarenkris...@gmail.com wrote:
Hi Gentle Men, Can any Please let me know How to Find a LONGEST PATH in a
Graph ( directed or Undirected but unweighted ).
INPUT: we have to give the Source vertex and Destination Vertex.
OUTPUT: it
In case cycle is present in the graph then we cant have a longest path in
the graph.Therefore the problem reduces to the longest path in a
tree.(Assuming the graph is connected).
Saurabh Singh
B.Tech (Computer Science)
MNNIT
blog:geekinessthecoolway.blogspot.com
On Wed, Feb 22, 2012 at 11:23
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
