Print the coordinates of nodes of a binary tree.
eg. A
BC
D EF G
A(3,2)
B(1,1)
C(5,1)
D(0,0)
E(2,0)
F(4,0)
G(6,0)
*Snehil Saxena
NIT Warangal
3rd yr*
--
You received this message because you are subscribed to the
iocl is coming to my college
please any dceite please tell what they are asking in their interview
process and what profile they are offering to the coe candidate
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
amazon will be visiting our campus within few days
any ideas about their pattern especially their online test
the questions asked by them and where they have visited recently for
campus placement
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
the interviewers are asking easy questions like spiral finding, loop in the
list, common ancestor etc..
--
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
ya amazon will be visiting our campus within few days
--
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
can anyone tell what kind of aptitude questions they are asking i.e. thier
level are they complex lrdi type. also their number
--
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
maybe some days after to ours
--
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
Can anyone tell me the iterative code to find mirror image of a binary
tree??
thanx..
--
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
Write a program to find the index in an circular array such that the
string that is formed starting from that index is first in
lexicographic order.
on all the sites the code part is misunderstood for the test case
ABCDEAABCCDA
--
You received this message because you are subscribed to the
in the circular array ABCDEABCCDE
The answer is 6 because the circular string starting from the element
A in the 6th position comes first in the dictionary formed from all
the possible strings of the circular array.
for ABCDEAABCCDA is 6
--
You received this message because you are subscribed
yes
--
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 at
@ankit
your answer is wrong for the test case ABCDEAABCCDA
--
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
ankit your solution gives answer 11 for test case ABCDEAABCCDA ie
AABCDEAABCCD
Isn't solution is AABCCDAABCDE ie 6
--
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
@ankit still your solution is not giving the correct result for this test
case
--
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 answer should be 6 correct me if i am getting the question wrong
#includeiostream
using namespace std;
int checkmin(char arr[],int size,int i,int j)
{
int k=0;
while(arr[i]==arr[j] ksize)
{
i=(i+1)%size;
j=(j+1)%size;
k++;
}
if(k==size)
return i;
thanx bro
--
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
how to find lrs efficiently
--
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
how to make a sufffix tree with different complexities along with its
uses
--
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
18 matches
Mail list logo
