Hi Shashi,
Please find the attached resume.
Please consider my resume for this job opening.
Thanks,
Ashu
On Thu, Nov 12, 2015 at 9:25 AM, shashi kant wrote:
> hi,
>
> *Note:* if an inappropriate mail ..please do ignore
>
> Opening in Oracle IDC: Having experience in C/C++ 1.5
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.
On Friday, 29 June 2012 19:46:43 UTC+5:30, zerocool142 wrote:
>
> Given an integer expression in a
Its palindrome
On Apr 20, 7:43 am, vikas wrote:
> couldn't understand the question :(
>
> On Apr 19, 1:32 pm, tech coder wrote:
>
>
>
>
>
>
>
> > determine whether the given string is of form pZq.
> > p and q can contain only X and Y.
> > like if p=XXYX then z will be XYXX
> > for ex XXYXX
yaar it was sooo easy,,,room mein aa utkarsh btata hun..
On Tue, Mar 29, 2011 at 6:05 AM, bittu wrote:
> @utkarsh i was just about to put Huffman algo ..yes it is optimized
> answer to solve the problem
>
> @all basicaly we have to minimize the cost of intermediate path ,final
> o/p will ob
essage 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
&
essage 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
&
i am getting 1.room pe aa btata hun..
On Sat, Mar 12, 2011 at 9:25 AM, UTKARSH SRIVASTAV
wrote:
> then what should be the answer of the test case 1 3 5 . i am getting 2 as
> answer
>
>
> On Sat, Mar 12, 2011 at 2:22 AM, Balaji Ramani
> wrote:
>
>> Try with trees at 1 3 and 5. Gives wrong out
launda pelu nikla.
On Thu, Mar 10, 2011 at 10:22 AM, UTKARSH SRIVASTAV wrote:
> WELL I HAVE DONE THIS PROBLEM .HERE IS THE CODE
> #include
> #include
> using namespace std;
> main()
> {
> long long int t[2][2010],price[2010],r,c,i,j,n;
> scanf("%lld",&n);
> for(i=0;i {
>
May be this helps
http://ds-gyan.blogspot.com/2009/12/two-numbers-with-minimum-difference.html
On Sep 28, 10:28 am, "coolfrog$"
wrote:
> @ sorurav
> yes , the basic logic is required so that the code can be understood in
> single Run..
> i also request the same to all dear friends.
>
Check the blog
http://ds-gyan.blogspot.com/2009/12/median-of-stream-of-numbers.html
You can form similar tree with node having count of left elements.
On Mar 8, 5:45 pm, Rohit Saraf wrote:
> once u do that.. the solution is trivial :P
> -Rohit
>
> On Mon, Mar 8, 2010 at 5:54 PM, Nikhil Agarwal
10 matches
Mail list logo
