yaa If any one has it, can you please mail it to me also
Thanks,
On Fri, Jun 24, 2011 at 2:36 PM, alok kediya wrote:
> any one downloaded or having link to download link, plz share it with me..
> thanks in advance :)
>
> Thanks,
> Alok
>
> On Thu, Jun 23, 2011 at 10:58 PM, Bhavesh agrawal
> wr
->next->next = temp; //A->C->A
temp = temp->next; //C->A->C
temp->next->next = NULL; //C->A->NULL
Correct me, If am wrong
Thanks,
On Fri, Apr 8, 2011 at 4:47 PM, murthy.krishn...@gmail.com <
murthy.krishn...@gmail.com> wrote:
> For the second case,
>
&g
For the second case,
Consider,
A -> B -> C -> NULL
Accor 2 me he has asked to reverse d list to make it as C -> A by deleting
B, which can be done like this,
temp->next = temp->next->next; // A->C->NULL
temp->next->next = temp; //A->C->A
temp = temp->next; //C->A->C
temp->next->next = NULL; //C
hey u can find dat clearly in C++: The complete reference. You can download
dat from here
http://asaha.com/ebook/DOTA5NDk-/C-The-Complete-Reference,-3rd-Edition.pdf
On Tue, Mar 29, 2011 at 12:07 AM, himanshu kansal <
himanshukansal...@gmail.com> wrote:
> can u gv any link for reference...???
>
>
Thanks itz really amazing :-)
On Tue, Mar 22, 2011 at 5:36 PM, ravi maggon wrote:
> Hey all,
> Do visit this website http://algorithmguru.com/content/index.php with many
> interesting features including algorithm rich repository, more than 300 ques
> of quiz and most interesting part its monthly
Thanks 2 all
On Mon, Mar 21, 2011 at 9:19 AM, Anurag atri wrote:
> @krishna - yeah as Bharath said that case should give NO , anyways you got
> it now :)
>
>
> On Mon, Mar 21, 2011 at 5:50 AM, murthy.krishn...@gmail.com <
> murthy.krishn...@gmail.com> wrote:
>
>>
@bharath yaa now I got the ques, thanx :-)
On Mon, Mar 21, 2011 at 4:47 AM, bharath kannan wrote:
> @murthy:no..the op must be NOits not a valid expression..read the two
> conditions for a valid expression..
>
> On Sun, Mar 20, 2011 at 8:23 PM, murthy.krishn...@gmail.com <
@anurag accor to me the output must be YES, correct me if I am wrong
On Sun, Mar 20, 2011 at 10:40 AM, bharath kannan wrote:
> i thot tat i had some mistake in my code and typed it all over again..
> finally i noticed this :)
>
>
>
> On Sat, Mar 19, 2011 at 12:12 AM, Kunal Patil wrote:
>
>> Hey.
can any 1 explain why we have 2 use segment trees ??
I am under the impression that in order to distinguish correct bracket
expressions, we can just count the number of left brackets and compare that
with the number of right brackets, if they are equal then it is a correct
bracket expression.
can
hey we can do like dis man using trial and error, so start with m = 15, 22,
29 etc. obviuosly we cant start with 8 as n must be greater than 1. I think
u people got the reason for starting with 15(1+14 is divisible by 7),
22(1+21 is divisible by 7) etc.
test for m = 15;
Day 1:- medals = 1+14/7 =
Hii, can you please tell me wat d ques exactly is ??
THanks,
Krishna.
On Wed, Mar 2, 2011 at 9:52 AM, sunny agrawal wrote:
> @bittu
> Question is about to print entire array in sorted order, not searching an
> element
>
> On Wed, Mar 2, 2011 at 4:13 AM, bittu wrote:
>
>> @all after 32 Message
how abt dis guys ??
#include
#include
#define MAX 100
int main()
{
int n;
int i;
int j;
int it;
char input[MAX];
char tmp;
scanf("%s",input);
n = strlen(input);
i = j = n/2;
for(it=1; it wrote:
> Are there any constraints in the problem, because it s
hii vinay,
the prob is we can get many such trees given a preorder traversal with the
condition that each node has zero or two children. Please correct me if I am
wrong.
Thanks,
Krishna.
On Wed, Feb 23, 2011 at 6:00 PM, murthy.krishn...@gmail.com <
murthy.krishn...@gmail.com> wrote:
&g
thanks vinay :-)
On Wed, Feb 23, 2011 at 5:39 PM, vinay reddy wrote:
> U need to construct a binary tree given only PreOrder traversal with the
> condition that each node has zero or two children.
>
> On Wed, Feb 23, 2011 at 10:52 AM, murthy.krishn...@gmail.com <
> murthy.k
hii vinay,
can u elaborate the third question
thanks,
Krishna
On Wed, Feb 23, 2011 at 9:34 AM, vinay reddy wrote:
> Hi Anurag,
>
> I have taken that online test there were 3 questions ...
> 1. given a linked list check if it is a palindrome.
> 2.given two sorted arrays a[m] b[2*m], each conta
15 matches
Mail list logo
