Given an unsorted array, how to divide them into two equal arrays whose
difference of sum is minimum.
--
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
@prankur
can we do in this manner, first find the middle of the array and make it as
a root, and call recursively from 0 to mid-1 for left subtree and mid+1 to
len-1 for right subtree..?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
Ques - *
struct node
{
int parentValue;
int childValue;
}str[10];
how to construct a BT,given an array of structure containing parent and
child value.
*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
*You have given any n*n matrix in which characters are stored and you have
to search that a given word is present or not.(words can be horizontally,
vertically, diagonally)*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
Anyone know the paper pattern or ques of snapdeal? And What they demand(any
specific language)?
--
Regards:
*Arun Kindra*
--
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
a) count total no of bit set in given no
b) increment the given no by one and count the no of bit set in it if it
equal to the above count then return else increment the no till u get the
count equals the above one.
--
You received this message because you are subscribed to the Google Groups
Is it for campus recruitment process or Off campus?
And can u specify the Apti topic, and is there any analytical reasoning?
If possible plz share Coding ques.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
Can anyone know Indus Valley Partners Paper Pattern and ques?
--
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://geeksforgeeks.org/forum/topic/algorithm-15?replies=6#post-39220
--
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
You can traverse in spiral order and add each element with the specified
co-ordinate.
--
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
*within
--
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
@harsha : yes, the problem is if u r finding only min and max value, it
might happen that u sell the stock before buying. Ex- int a [ ] = { 5, 10,
4, 6, 7 }; the min value is 4 and max is 10 and 10 comes before 4, means u
sell the stock before buying.
and i think the sol given by mukul does the
http://www.krishnabharadwaj.info/national-instruments/
--
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
@Dave Sir : Sir if u sort the array(given above) the array would be:
-20,-8-2,4,9,10,12,14,17, and according to ur suggestion, the only ans is
{9,10}...but one of the ans {9,-8} is also possible...as he is asking
the difference in absolute values.
correct me if i m wrong...
--
You received
compiler dependent
--
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
This will help u
http://www.geeksforgeeks.org/archives/570
--
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
16 matches
Mail list logo
