Hi all,
There are multiple openings for SDE1 and SDE2 for Amazon hyderabad and
Bangalore location. Interested candidates please send your resume to
sahilmadaann...@gmail.com
Thanks
sahil
--
It's b.
Windows follow this Operation.
On Fri, Dec 7, 2012 at 4:21 AM, manish narayan.shiv...@gmail.com wrote:
Four processes of 1gb,1.2gb,2gb,2gb are there and RAM available is 2gb.
We have a
time shared system. Which of the following is the most appropriate
scheduling algorithm?
a. all
There will be written test followed by technical and telephonic interview.
For typical questions you refer to geekforgeeks.org.
Sahil Gupta
On Sat, Oct 13, 2012 at 12:56 AM, Bharat Singhvi
bharatsinghvi.1...@gmail.com wrote:
Hi,
We have DirectI coming to campus tomorrow.
I was wondering
sum of all the partitioned rectangles in O(1) reducing our
complexity to O(n^2)..So, our job now is just to precompute the matrix..
On Sunday, 12 August 2012 17:48:07 UTC+5:30, sahil taneja wrote:
Divide 2D array into 4 parts. Compute sum of each partition and get max
value from the four
Can any one help me with this ...Any DP solution?
On Sunday, 12 August 2012 17:48:07 UTC+5:30, sahil taneja wrote:
Divide 2D array into 4 parts. Compute sum of each partition and get max
value from the four of them. For all possible partitions get min value of
such max values computed
Divide 2D array into 4 parts. Compute sum of each partition and get max
value from the four of them. For all possible partitions get min value of
such max values computed.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this
Please wait for someone to reply.
Then ask personally for paper through his or her email id.
Stop spaming the group.
Sahil Gupta.
On Thu, Aug 9, 2012 at 9:56 PM, *$* gopi.komand...@gmail.com wrote:
Mail to me also plz
On Aug 9, 2012 9:55 PM, rahul sharma rahul23111...@gmail.com wrote:
Mail
* from this structure which means append each list pointed by
third pointer to original one such that it like simple *DLL*.
On Thu, Aug 2, 2012 at 5:45 PM, Navin Kumar algorithm.i...@gmail.comwrote:
@sahil: Please elaborate your question. I didn't understand your question.
what is straight doubly
There is doubly link list and each node is having another pointer which is
points to another doubly link list or points to null.
You need make it straight doubly link list.
Provide the efficient code.
Sahil Gupta
--
You received this message because you are subscribed to the Google Groups
hey check this out.. http://www.w3schools.com/html/html_forms.asp
Hope this will serve the purpose:)
On Tuesday, 17 July 2012 01:12:02 UTC+5:30, nandita raman wrote:
Hello,
I am working on PHP/HTML/ XML-RPC.
I have a website, where one link shows the list of files as checkboxes and
a
Hey what was the facebook question at IIT Roorkee?
On Nov 5, 6:04 pm, saket saket.ma...@gmail.com wrote:
As far as I have googled about the 'game of life' problem, of which
this question is a variant ; no mathematical pattern/series emerges
out of it ...
but in this problem since the moves
in a list for a given course. O(m)
let me know if it sounds good..
Sahil Garg
Computer Engineering
Delhi College of Engineering
On Sun, Oct 30, 2011 at 1:17 AM, Aamir Khan ak4u2...@gmail.com wrote:
In a university, students can enroll in different courses. A student may
enroll for more than one
which colg??
Sahil Garg
Computer Engineering
Delhi College of Engineering
On Mon, Sep 26, 2011 at 2:04 PM, aditya kumar
aditya.kumar130...@gmail.comwrote:
5.5 lakhs
On Mon, Sep 26, 2011 at 1:46 PM, Aditya Virmani
virmanisadi...@gmail.comwrote:
what package did they offer?
On Mon, Sep
plz post the soln.. i cant find it..
Sahil Garg
Computer Engineering
Delhi College of Engineering
On Tue, Sep 27, 2011 at 3:41 PM, shady sinv...@gmail.com wrote:
discussed, kindly look at archives
On Tue, Sep 27, 2011 at 3:13 PM, surender sanke surend...@gmail.comwrote:
print all numbers
how much package??
Sahil Garg
Computer Engineering
Delhi College of Engineering
On Sun, Sep 25, 2011 at 1:32 AM, aditya kumar
aditya.kumar130...@gmail.comwrote:
since the company is about data and storage manageemnt so do we need to
stress on DBMS .??
and thnks fr all the help :)
On Sat
plz do tell..
i also need sm intervw questions at the earliest..
Sahil Garg
Computer Engineering
Delhi College of Engineering
On Thu, Sep 29, 2011 at 12:26 PM, Chunky Garg g.chunkyg...@gmail.comwrote:
Can anyone tell me about tally solutions pvt ltd.
how is the company and growth
pls send me d book too
really need it
thanks
regards
sahil
--
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
n=n+1
n++
++n
which of the three is better ??
Sahil Garg
Computer Engg. DCE
--
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
hey.. plz post your experience??
Sahil Garg
Computer Engg. DCE
On Wed, Aug 3, 2011 at 11:54 PM, Deepak deepakthegi...@gmail.com wrote:
Can anyone pls post Paypal written questions and important subjects or
topics to prepare for written as well as for tech interview?? Thanks
in advance
hey plz post ur experience??
Sahil Garg
Computer Engg. DCE
On Mon, Aug 8, 2011 at 8:43 PM, siva viknesh sivavikne...@gmail.com wrote:
not sure i m also gonna attend wit u only if u r from anna univ :P
On Aug 6, 7:44 pm, swetha rahul swetharahu...@gmail.com wrote:
Thanks Siva
= 3
last = 0
as 43
consider 4 0
for 2 elements
simply find the index of min element
now u have the index of 0 in log(n).
Sahil Garg
Computer Engg. DCE
On Thu, Sep 22, 2011 at 1:31 PM, siva viknesh sivavikne...@gmail.comwrote:
eg : original : 0 1 2 3 4
corrupted : 3 4 0 1 2
--
You
thnx siva..
Sahil Garg
Computer Engineering
Delhi College of Engineering
On Thu, Sep 22, 2011 at 10:10 PM, siva viknesh sivavikne...@gmail.comwrote:
first round was mixture of c , cpp , very few general aps and few
subjective ques
print semicolon without using semicolon anywhere
do they have sectional cutoff for e-litmus..??
Sahil Garg
Computer Engg. DCE
On Sat, Sep 17, 2011 at 5:12 PM, rahul sharma rahul23111...@gmail.comwrote:
no gd
On Sat, Sep 17, 2011 at 1:51 PM, Ankur Khurana
ankur.kkhur...@gmail.comwrote:
For internship it was , Percentage , then GD
/algogeeks?hl=en.
--
Sent from my mobile device
Sahil Garg
Computer Engg. DCE
--
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
yes u r wrong..
1 is nt divisible by 23
On Sat, Aug 6, 2011 at 9:15 AM, sumit sumitispar...@gmail.com wrote:
This looks quite simple.
Every number ending in 3 follows a pattern.eg-
3 - 111
13 - 11
23 - 1 etc
we can find the reauired no. by :
suppose input no. is 33
In
#includestdio.h
int main()
{
int i=32, j=0x20 ,k,l,m;
k= i|j;
l=ij;
m= k^ l;
printf(%d %d %d %d %d\n,i,j,k,l,m);
return 0;
}
output:
32 32 32 32 0
please explain me ... j=0x20;wht does it mean.?
and hoe ite value is 32...???
--
You received this message because you are subscribed
#includestdio.h
void main()
{ int i = 4;
switch (i)
{
default: ;
case 3:
i += 5;
if ( i == 8)
{
i++;
if (i == 9) break;
i *= 2;
}
i -= 4;
break;
case 8:
i += 5;
break;
}
printf(i = %d\n, i);
}
output:
i=5
how..? can sme one explain...!!
--
You received this message because you
can sme body tell me..?
1)
#include stdio.h
int main()
{
int i= -3, j=2 ,k=0, m;
m= ++i ++j || ++k;
printf(%d %d %d %d\n,i,j,k,m);
return 0;
}
output:
-2 3 0 1
2)#include stdio.h
int main()
{
int i= -3, j=2 ,k=0, m;
m= ++i || ++j ++k;
printf(%d %d %d %d\n,i,j,k,m);
return 0;
}
ok i got the values of i ,j ,k ,.in all the 3 codes but can u please
explain me how we get the value of m =1 in all the 3 program.?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
no data structure.
rather implement chess board like a matrix and its(knight's)8 different
types of movement.
On Thu, Mar 24, 2011 at 6:19 PM, snehal jain learner@gmail.com wrote:
Design a data structure to represent the movement of a knight on a
chess board.
--
You received this
stack for sure..
pop out the enteries till they r same and push this entry back once.
On Wed, Feb 16, 2011 at 11:18 AM, jalaj jaiswal
jalaj.jaiswa...@gmail.comwrote:
can any1 tell me the question .. m gettin half of the post ,...
On Wed, Feb 16, 2011 at 10:41 AM, Jammy xujiayiy...@gmail.com
explain the 1st one again
On Thu, Dec 9, 2010 at 11:16 AM, Anand anandut2...@gmail.com wrote:
One of my friend recently had a telephonic interview and he got two
question to program.
1. Given a binary search tree. Write a function which takes any given node
from the binary tree and a
they will be integers in q2...
On 10/2/10, swayambhoo jain swayambhoo.j...@gmail.com wrote:
Are the four numbers in question #2 integers or they can be anything?
On Sat, Oct 2, 2010 at 10:03 AM, swayambhoo jain
swayambhoo.j...@gmail.comwrote:
What about the case when we have repeated
33 matches
Mail list logo
