Hey, can you please mail me too?
-Thanks
Nilanjan Basu
On Tuesday, July 31, 2012 9:49:15 PM UTC+5:30, MUDIT wrote:
>
>
> Please forward the mail to me as well.
> Thanks
>
> --
> Mudit Sadana
> Undergraduate Student,Computer Science
> NSIT, Delhi University,India
>
>
--
You received this me
May be I am missing a few details. But Consider this 3D array:
{
{
{1,2},
{7,8} // First 2D array
},
{
{3,4},
{9,10}
}
}
If you search for 3 then your search in first step will give first 2D which
actually does not contain 3. As per my interpretation of t
I think this algo is correct.
On Sunday, 1 July 2012 13:06:17 UTC+5:30, Ashu wrote:
>
> count=0;
> Start parsing from left to right
> If operator push in stack.
> In number add in queue and increment count by one,
> if count == 2 then
> pop from stack add in queue, decrements the count by one.
>
