I actually attended on-campus through my college...
On 26 May 2011 16:24, "jagannath prasad das" wrote:
how to register for amazon ol exm .can you plz mention ?
On Sun, Apr 24, 2011 at 6:46 PM, balaji a wrote:
> >
> > yeah i did.,...there were two section
> > Section 1 - some aptitude questi
@gopi
by mistake i have written "i" in place of IN[i];
my fault, 2nd thing( (F[i].idx - F[i-1].idx - (F[i].rep - F[i-1].rep) ) i
have really not think of that. thanks :)
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group,
Depends on the parameter list of sqr function and also on type of c.If it
takes double as parameter and returns double than false else true,Correct me
if wrong,..
On Fri, May 27, 2011 at 8:56 AM, Balaji S wrote:
> sqr(sqrt(c)) == c
>
> what ll it return if c is 10...
>
>
> --
> You received thi
sqr(sqrt(c)) == c
what ll it return if c is 10...
--
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 to
algogeeks+unsubscr...@googlegro
bool fn(const float&c)
{//a^2+b^2=c
if (sqr(sqrt(c)) == c) //perfect square
{
float a=1; float b=c-1;
while(a<=b){
float a2=a*a;
float b2=b*b;
if (a2+b2==c) return true;
if (a*2+b2 wrote:
> can anyone help me out with this problem:
> https://www.spoj.pl/problems/TWOSQRS/
> It run
Hello,
Hope you are doing well.
I am a technical recruiter with Panzer Solutions LLC Software Implementing
and IT consulting company located in CT. Please go through the Job
Description and send me your updated resume with contact information.
*Please reply at soh...@panzersolutions.com
** *
Titl
Hello,
Hope you are doing well.
I am a technical recruiter with Panzer Solutions LLC Software Implementing
and IT consulting company located in CT. Please go through the Job
Description and send me your updated resume with contact information.
Title : Senior Network Admi
Hello,
Hope you are doing well.
I am a technical recruiter with Panzer Solutions LLC Software Implementing
and IT consulting company located in CT. Please go through the Job
Description and send me your updated resume with contact information.
*Please reply at soh...@panzersolutions.com* *
*
Title
Pthread is a User level thread ,
Java threading cant be distinguished as user level or kernel level ,
the java threads are contained in JVM and mapping is used by OS to map
JVM to kernel threads.
On Thu, May 26, 2011 at 4:55 PM, anshu mishra wrote:
> it is os responsibility to map user level thr
Hello,
Hope you are doing well.
I am a technical recruiter with Panzer Solutions LLC Software Implementing
and IT consulting company located in CT. Please go through the Job
Description and send me your updated resume with contact information.
*
Please reply at soh...@panzersolutions.com
*
Title
You are given a large string. You need to cut the string into chunks such
that each substring that you get is a palindrome. Remember that each 1
length string is always a palindrome. You need to find the minimum number of
cuts that you need to make such that each substring is a palindrome.
--
Yo
Map , key will be the wrong wrd , so lookup will be O(1).
On Thu, May 26, 2011 at 10:07 PM, himanshu kansal
wrote:
> if a large no of documents are available and need to find out the
> spelling errors.for this the words are compared wd a dictionary
> fileif a word is nt present in diction
wait !! wait !!
@Anshuman sir...u have left few case ;
I corrected ur code and got accepted at spoj.
Here is the correct code;
//here F[] is array which got 3 fields ( element value(same as ur D[]
array) , its index in original input(same as ur IN[] array) , number
of elements less than it till
if a large no of documents are available and need to find out the
spelling errors.for this the words are compared wd a dictionary
fileif a word is nt present in dictionary thn it is sure dt d word
is wrong...thn v hv to print d no of occurences of the wrong
wordassuming dt d word vl occ
Hello,
Hope you are doing well.
I am a technical recruiter with Panzer Solutions LLC Software Implementing
and IT consulting company located in CT. Please go through the Job
Description and send me your updated resume with contact information.
Please reply at soh...@panzersolutions.com
Title
Hello,
Hope you are doing well.
I am a technical recruiter with Panzer Solutions LLC Software Implementing
and IT consulting company located in CT. Please go through the Job
Description and send me your updated resume with contact information.
*Please reply at soh...@panzersolutions.com
*
Title
Mark as it reads ?(Question Mark) Crimson.
--
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 to
algogeeks+unsubscr...@googlegroups.com.
Hello,
Hope you are doing well.
I am a technical recruiter with Panzer Solutions LLC Software Implementing
and IT consulting company located in CT. Please go through the Job
Description and send me your updated resume with contact information.
*
Please reply at soh...@panzersolutions.com
*
Title
Hello,
Hope you are doing well.
I am a technical recruiter with Panzer Solutions LLC Software Implementing
and IT consulting company located in CT. Please go through the Job
Description and send me your updated resume with contact information.
*Please reply at soh...@panzersolutions.com
*
Title
+1000 ..dont count this as SPAM! :D
On Thu, May 26, 2011 at 9:29 PM, radha krishnan <
radhakrishnance...@gmail.com> wrote:
> +100
>
> On Thu, May 26, 2011 at 9:26 PM, pacific :-) wrote:
>
>> +1
>>
>>
>> On Wed, May 25, 2011 at 11:48 PM, anuj agarwal wrote:
>>
>>> Hi,
>>>
>>> Are there any admins
+100
On Thu, May 26, 2011 at 9:26 PM, pacific :-) wrote:
> +1
>
>
> On Wed, May 25, 2011 at 11:48 PM, anuj agarwal wrote:
>
>> Hi,
>>
>> Are there any admins on this group? I recently joined this group and i
>> liked the discussions going on here.
>>
>> But there is a problem which hurts is that
+1
On Wed, May 25, 2011 at 11:48 PM, anuj agarwal wrote:
> Hi,
>
> Are there any admins on this group? I recently joined this group and i
> liked the discussions going on here.
>
> But there is a problem which hurts is that unlike other groups which are
> moderated by certain admin guys (also act
@Anshuman sir
There is mistake in above code :
u wrote -->> " ans[IN[i]] = curtime + (D[i] - last - 1) * rem + (i -
L[IN[i]] + 1); "
I think it should be -->> "ans[IN[i]] = curtime + (D[i] - last - 1) *
rem + (IN[i]- L[IN[i]] + 1);
correct me if i m wrong
On May 26, 9:17 am, anshu mishra
But checking the count is a good first step. If the count doesn't
match the result is false. If the count does match, you need to check
further. I found that my test set ran 10x faster if I checked the
count first.
Don
On May 26, 6:11 am, sunny agrawal wrote:
> @senthil
> nopes, it will not work
Gys, this problem can b esolved using dynamic programming in o n^2.l
recursive/iterative approach wont work.
Regards
Saurabh
On Thu, May 26, 2011 at 4:41 PM, sunny agrawal wrote:
> @senthil
> nopes, it will not work
> eg.
> S3 = "cba"
> S1 = "a"
> S2 = "bc"
> count matches but not interleaved
>
it is os responsibility to map user level thread to kernel level thread.
Usually os implements many to many mapping.
In pthread we can bind a particular thread to particular processor or set of
processor.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Gee
@senthil
nopes, it will not work
eg.
S3 = "cba"
S1 = "a"
S2 = "bc"
count matches but not interleaved
On Thu, May 26, 2011 at 2:43 PM, Senthil S wrote:
> Can it be done this way ..Take count of each alphabet for all the three
> strings and store separately.. Then for each alphabet in the third st
how to register for amazon ol exm .can you plz mention ?
On Sun, Apr 24, 2011 at 6:46 PM, balaji a wrote:
> yeah i did.,...there were two section
> Section 1 - some aptitude question + predicting output of a given program +
> some conceptual question(mainly in OS)
> Section 2- programming secti
Pthread is a user-level thread or kernel-level?.Java
supports user-level threading i know ,but while doing a project on
web-
crawling i marked the cpu-utilization in conky(ubuntu) ,both the
cores' utilization increased drastically as program ran.I know that in
user-level threading kernel is not awa
Can it be done this way ..Take count of each alphabet for all the three
strings and store separately.. Then for each alphabet in the third string,
check if its count is equal to the sum of the counts of the corresponding
alphabet in the first two strings .. If the counts match for all alphabets
the
Mark
On Thu, May 26, 2011 at 1:05 PM, Lavesh Rawat wrote:
> *Mystery Puzzle Sherlock Holmes
> *
> *
> *
> **
> *One snowy night, Sherlock Holmes was in his house sitting by a fire. All
> of a sudden a snowball came crashing through his window, breaking it.
> Holmes got up and looked out the wind
*Mystery Puzzle Sherlock Holmes
*
*
*
**
*One snowy night, Sherlock Holmes was in his house sitting by a fire. All of
a sudden a snowball came crashing through his window, breaking it.
Holmes got up and looked out the window just in time to see three
neighborhood kids who were brothers run around
thanks :) it worked. cheers
On May 25, 12:12 pm, Saikat Debnath wrote:
> I think your problem is you are using int. Use long long.
>
>
>
>
>
>
>
> On Thu, May 26, 2011 at 12:29 AM, ricky wrote:
> > can anyone help me out with this problem:
> >https://www.spoj.pl/problems/TWOSQRS/
> > It runs on
33 matches
Mail list logo
