@sagar: The question says Algo should be in place. So use of an array to
print the right border of tree is not advisable. We can do it recursively
without using an array also .
On Sat, Jul 16, 2011 at 10:48 PM, sameer.mut...@gmail.com
sameer.mut...@gmail.com wrote:
@sagar: There is one flaw in
@reynaled :- Happy to help
@Sameer :- Thanks for pointing out and i think all you guyz now can optimize
it :)
On Sun, Jul 17, 2011 at 11:35 AM, sameer.mut...@gmail.com
sameer.mut...@gmail.com wrote:
@sagar: The question says Algo should be in place. So use of an array to
print the right border
hey today ms visited our campus they asked simple 10 c output in first round
and than 45 minutes coding round one question on test case on notepad,design
bigint class,one simple question on array.
On Sun, Jul 17, 2011 at 3:42 PM, sagar pareek sagarpar...@gmail.com wrote:
@reynaled :- Happy to
Yeah best of luck saurabh
whaen results will be out?
On Sun, Jul 17, 2011 at 3:47 PM, sourabh jakhar sourabhjak...@gmail.comwrote:
hey today ms visited our campus they asked simple 10 c output in first
round and than 45 minutes coding round one question on test case on
notepad,design bigint
@sourabh jakhar:
how to design that big int class?? what data structure to use??
On Sun, Jul 17, 2011 at 3:55 PM, sourabh jakhar sourabhjak...@gmail.comwrote:
i donot know abt the results but one thing for sure get your basic first
right and than do the weird question
On Sun, Jul 17, 2011
@saurabh
Ok...
on 20th amazon is coming :)
On Sun, Jul 17, 2011 at 4:35 PM, prasanth n nprasnt...@gmail.com wrote:
@sourabh jakhar:
how to design that big int class?? what data structure to use??
On Sun, Jul 17, 2011 at 3:55 PM, sourabh jakhar
sourabhjak...@gmail.comwrote:
i donot
@prasanth
Trie will be used... :) :)
On Sun, Jul 17, 2011 at 5:28 PM, sagar pareek sagarpar...@gmail.com wrote:
@saurabh
Ok...
on 20th amazon is coming :)
On Sun, Jul 17, 2011 at 4:35 PM, prasanth n nprasnt...@gmail.com wrote:
@sourabh jakhar:
how to design that big int class??
@sagar pareek:
we cant use linked list ah??
On Sun, Jul 17, 2011 at 6:44 PM, sagar pareek sagarpar...@gmail.com wrote:
kk...
On Sun, Jul 17, 2011 at 5:31 PM, sourabh jakhar
sourabhjak...@gmail.comwrote:
@sagar pareek
if you are from mnnit than donot disclose these kind of things here .
yeah it can be
On Sun, Jul 17, 2011 at 6:47 PM, prasanth n nprasnt...@gmail.com wrote:
@sagar pareek:
we cant use linked list ah??
On Sun, Jul 17, 2011 at 6:44 PM, sagar pareek sagarpar...@gmail.comwrote:
kk...
On Sun, Jul 17, 2011 at 5:31 PM, sourabh jakhar
@sagar pareek:
thanks
On Sun, Jul 17, 2011 at 6:50 PM, sagar pareek sagarpar...@gmail.com wrote:
yeah it can be
On Sun, Jul 17, 2011 at 6:47 PM, prasanth n nprasnt...@gmail.com wrote:
@sagar pareek:
we cant use linked list ah??
On Sun, Jul 17, 2011 at 6:44 PM, sagar pareek
can anyone pls tell me how to print 2D array in spiral manner?/
On 7/17/11, prasanth n nprasnt...@gmail.com wrote:
@sagar pareek:
thanks
On Sun, Jul 17, 2011 at 6:50 PM, sagar pareek sagarpar...@gmail.com wrote:
yeah it can be
On Sun, Jul 17, 2011 at 6:47 PM, prasanth n
here is the code
void border(node*);
void recur(node*);
void border(node *ptr)
{
node* tmp; int stack[20],top=0;
if(tmp=ptr-left)
{
while(tmp-left)
{
printf(%d ,tmp-data);
tmp=tmp-left;
}
}
recur(ptr);
if(tmp=ptr-right)
{
while(tmp-right)
{
stack[top++]=tmp-data;
@Reynald
Will 75 not be included in the tree that u have
given..??
On Sun, Jul 17, 2011 at 12:49 AM, sagar pareek sagarpar...@gmail.comwrote:
here is the code
void border(node*);
void recur(node*);
void border(node *ptr)
{
node* tmp; int stack[20],top=0;
according to saagar's algo, it'll be printed ...
On Sun, Jul 17, 2011 at 1:02 AM, swetha rahul swetharahu...@gmail.comwrote:
@Reynald
Will 75 not be included in the tree that u have
given..??
On Sun, Jul 17, 2011 at 12:49 AM, sagar pareek
yup :)
On Sun, Jul 17, 2011 at 1:03 AM, Shubham Maheshwari
shubham.veloc...@gmail.com wrote:
according to saagar's algo, it'll be printed ...
On Sun, Jul 17, 2011 at 1:02 AM, swetha rahul swetharahu...@gmail.comwrote:
@Reynald
Will 75 not be included in the
Sagar , Shubam Maheshwari
Thanks!!
On Sun, Jul 17, 2011 at 1:11 AM, sagar pareek sagarpar...@gmail.com wrote:
yup :)
On Sun, Jul 17, 2011 at 1:03 AM, Shubham Maheshwari
shubham.veloc...@gmail.com wrote:
according to saagar's algo, it'll
A pre-order traversal which is used to index the (min,max) pair value
at each level except the bottom-most level where all the entries are
to be printed. O(n) time O(log n) memory.
On 7/17/11, swetha rahul swetharahu...@gmail.com wrote:
Sagar , Shubam Maheshwari
Sagar;s Algo works, thank you so much guys.
On Sun, Jul 17, 2011 at 3:41 AM, SkRiPt KiDdIe anuragmsi...@gmail.comwrote:
A pre-order traversal which is used to index the (min,max) pair value
at each level except the bottom-most level where all the entries are
to be printed. O(n) time O(log n)
Yep!
On Sun, Jul 17, 2011 at 1:02 AM, swetha rahul swetharahu...@gmail.comwrote:
@Reynald
Will 75 not be included in the tree that u have
given..??
On Sun, Jul 17, 2011 at 12:49 AM, sagar pareek sagarpar...@gmail.comwrote:
here is the code
void border(node*);
please explain the code a bit more.. unable to understand it..an example
will be better..
On Sun, Jul 17, 2011 at 7:10 AM, Reynald Suz reynaldsus...@gmail.comwrote:
Yep!
On Sun, Jul 17, 2011 at 1:02 AM, swetha rahul swetharahu...@gmail.comwrote:
@Reynald
Will 75
@sagar: There is one flaw in the code. Trace ur code 15 and 250 get printed
twice. otherwise it is fine.
On Sat, Jul 16, 2011 at 7:59 PM, sukhmeet singh sukhmeet2...@gmail.comwrote:
please explain the code a bit more.. unable to understand it..an example
will be better..
On Sun, Jul 17,
21 matches
Mail list logo
