does ur sol seems lyk incerasing 1 if next number is greater that prev n
decreasing 1 if less..???
--
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,
@wgp the ques is to maintain the order intact..
--
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
it seems @hassan sol is correctcan nybody knw d flaw in it???
--
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
@ashish it wont be...first we r finding one end from any node dat is r n
den frm dat end we r traversing to other deepest end...
it is possible dat r b d intermediate node...n distance from r to v2 is
smaller than from r to v1
--
You received this message because you are subscribed to the Google
single traversal n O(n) are 2 diff things...plz specify???
--
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
@atul if range is high den complexity wud be much larger...
--
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
The postage stamp problem is a mathematical riddle that asks what is the
smallest postage value which cannot be placed on an envelope, if the letter
can hold only a limited number of stamps, and these may only have certain
specified face values.
For example, suppose the envelope can hold only
@hemesh cud u plz elaborate wat is b[k]=a[i]+a[j]...n also ur solution...
--
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
http://www.geeksforgeeks.org/archives/8133
--
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.
the main code is dis function only:i will explain dis
static Node treeToList(Node root) {
Node aList, bList;
if (root==NULL) return(NULL);*
/* the below next two lines are just lyk inorder traversal...u mst
hv done dis*/*
aList = treeToList(root-small);
bList =
min heap wid N elements containing first line from each file will do...
remove the top most n insert next one from dat file only
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
@prem can u plz explain the variables used in the modified structure...n if
m nt wrong then ur sol can result in repeated anagrams if characters in the
words are repeated
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
12 matches
Mail list logo
