Hey... got ur interview done. Please do share all the details about the interview and your experience. If possible gimme other ideas and ur friends ideas. I'll attend at bangalore in the next week. Please do repsond. :-)
--~--~-~--~~~---~--~~
You received this
Please tell abou the interview. no of interviews, interviewers, questions, etc. Also please tell about the area and kinds of questions (if possuble the questions ietself) difficulty level. etc. please.
--~--~-~--~~~---~--~~
You received this message because you are
Thank you so much.
--~--~-~--~~~---~--~~
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 [EMAIL
Thank you!!!
--~--~-~--~~~---~--~~
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 [EMAIL PROTECTED]
can you explain that why the test you mentioned
works?
Consider
ax+0xff
changes the 0x100 bit iff the low-order byte of ax is not zero.
~ax
always changes the 0x100 bit.
(~ax^(ax+0xff)) 0x100
is zero iff both ~ax and ax+0xff have the same thing at the 0x100
position.
You can extend
At best this is closed-minded. At worst it's ignorant.
There are lots of cases where adding some formalism to intuitive
notions has produced wonderful new insights.
Take for example the denotational semantics of recursive definitions
(or loops if you prefer). These were obvious just as you
I hope this isn't homework.
This is can be solved with a DP roughly similar to the classic one for
subset sum. Let X and Y be the districts. Use a 4d table of booleans
G.
G(i,x,y,p) is true iff there is an assignment of precincts P(1)...P(i),
with p in X and i-p in Y, and with x and y gnu
