tag:blogger.com,1999:blog-5240296697449766851.post7028331382491172170..comments2023-05-16T03:17:52.389-07:00Comments on J2EE Now: Google Interview Questions Part 1bloggerhttp://www.blogger.com/profile/15356038737434670344noreply@blogger.comBlogger14125tag:blogger.com,1999:blog-5240296697449766851.post-68596491221114150212011-11-19T16:15:55.267-08:002011-11-19T16:15:55.267-08:00Thanks for sharing such an interesting post with u...Thanks for sharing such an interesting post with us. You have made some valuable points which are very useful for all readersviagrahttp://buyviagracheapmedicorder.comnoreply@blogger.comtag:blogger.com,1999:blog-5240296697449766851.post-3628398313078943642011-04-25T13:43:23.900-07:002011-04-25T13:43:23.900-07:00This is really interesting because I've never ...This is really interesting because I've never had an interview like that before, I'd like to know how to solve it easier in order to learn the technique just in case taking a interview like that.m10mkamagrahttp://www.iservepharmacy.com/noreply@blogger.comtag:blogger.com,1999:blog-5240296697449766851.post-42332586636568123912010-11-24T03:08:03.535-08:002010-11-24T03:08:03.535-08:00Hi, well be sensible, well-all describedHi, well be sensible, well-all describedgeneric cialishttp://www.agir-galiza.org/noreply@blogger.comtag:blogger.com,1999:blog-5240296697449766851.post-33260866255536843232008-03-18T03:03:00.000-07:002008-03-18T03:03:00.000-07:00Some more google interviewsInterview At GoogleGoog...Some more google interviews<BR/><BR/><A HREF="http://placementsindia.blogspot.com/2007/09/google-interview-questions.html" REL="nofollow">Interview At Google</A><BR/><A HREF="http://placementsindia.blogspot.com/2007/09/google-top-interview-puzzles.html" REL="nofollow">Google Top Interview Questions ( around 30 With Solutions)</A><BR/><A HREF="http://placementsindia.blogspot.com/2007/08/google-freshers-latest-interview.html" REL="nofollow">Google Interview for Freshers</A>chaitanyahttps://www.blogger.com/profile/05855949584266440305noreply@blogger.comtag:blogger.com,1999:blog-5240296697449766851.post-41119792312020705492008-03-18T03:02:00.000-07:002008-03-18T03:02:00.000-07:00Some more interviewsInterview At GoogleGoogle Top ...Some more interviews<BR/><A HREF="http://placementsindia.blogspot.com/2007/09/google-interview-questions.html" REL="nofollow">Interview At Google</A><BR/><A HREF="http://placementsindia.blogspot.com/2007/09/google-top-interview-puzzles.html" REL="nofollow">Google Top Interview Questions ( around 30 With Solutions)</A><BR/><A HREF="http://placementsindia.blogspot.com/2007/08/google-freshers-latest-interview.html" REL="nofollow">Google Interview for Freshers</A>chaitanyahttps://www.blogger.com/profile/05855949584266440305noreply@blogger.comtag:blogger.com,1999:blog-5240296697449766851.post-60922690562644310382008-02-21T06:10:00.000-08:002008-02-21T06:10:00.000-08:00You can view the solution hereYou can view the solution <A HREF="http://www.harvestmanontheweb.com/programs/google/sumlist.py" REL="nofollow">here</A>Anandhttps://www.blogger.com/profile/18362312542208032325noreply@blogger.comtag:blogger.com,1999:blog-5240296697449766851.post-25987910837728715432008-02-21T06:08:00.000-08:002008-02-21T06:08:00.000-08:00This problem is explained well in "Programming Pea...This problem is explained well in "Programming Pearls" by John Bentley. He gives 4 different solutions to it with asymptotic complexity of O(n3), O(n2), O(nlogn) and O(n). <BR/><BR/>You can view the O(n) solution in Python at http://www.harvestmanontheweb.com/programs/google/sumlist.pyAnandhttps://www.blogger.com/profile/18362312542208032325noreply@blogger.comtag:blogger.com,1999:blog-5240296697449766851.post-63335873298708268082008-01-14T14:34:00.000-08:002008-01-14T14:34:00.000-08:00The solution is to buy the book "Programming Pearl...The solution is to buy the book "Programming Pearls" by Jon Bentley and read the answer there; it contains a comprehensive and interesting treatment of this problem.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-5240296697449766851.post-79051478918989029282008-01-14T12:48:00.000-08:002008-01-14T12:48:00.000-08:00I think the question is okay. From my experience, ...I think the question is okay. From my experience, the smartest programmers will focus some of the interview time on asking such questions, typically around 15% of the time, while dumbest programmers will focus nearly 100%of their questions on them.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-5240296697449766851.post-17321397536617613942008-01-14T11:05:00.000-08:002008-01-14T11:05:00.000-08:00Any subset is a substring of the original string (...Any subset is a substring of the original string (thinking of a subarray as a substring)...<BR/><BR/>To find any substring, first find the start of the subtring and then the end.<BR/><BR/>When trying to find the start: When you hit a negative number, discard the substring.<BR/><BR/>Then find the ending (you need to reach the end of the string to know where it should end).<BR/><BR/>This problem is pretty hard, I think, but it can be done in O(n) because whenever the total of the substring you are calculating is > 1, then it "pays" to add to other strings. The problem is how to divide the search...Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-5240296697449766851.post-7318153974204472832008-01-14T09:48:00.000-08:002008-01-14T09:48:00.000-08:00that is just retarded, i heard about google dumb i...that is just retarded, i heard about google dumb interviews, but this one is the best.<BR/><BR/>P.S. if they were smart they would ask about advance math. I just wonder what stupid biology questions they have, where is the liver? make it harder damn it, ask about small bones.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-5240296697449766851.post-24752780130106153802008-01-14T06:11:00.000-08:002008-01-14T06:11:00.000-08:00That's the tipical kind of problem you forget how ...That's the tipical kind of problem you forget how to solve when you work for years using high level frameworks (in any language); in my career I have never seen a case where a problem of this complexity had to be solved.<BR/>I think I'll have to change the way I work or I'll become even dumber in the years to come!Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-5240296697449766851.post-43530389777034863582008-01-14T05:17:00.000-08:002008-01-14T05:17:00.000-08:00You can found the complete solution on this post:g...You can found the complete solution on this post:<BR/><BR/><A HREF="http://j2ee-now.blogspot.com/2007/12/google-interview-questions-part-2.html" REL="nofollow">google interview questions part 2</A>bloggerhttps://www.blogger.com/profile/15356038737434670344noreply@blogger.comtag:blogger.com,1999:blog-5240296697449766851.post-23520254115036635782008-01-14T02:48:00.000-08:002008-01-14T02:48:00.000-08:00Run through the list but with two additional varai...Run through the list but with two additional varaibles: Sum and int array where Sum is used to compare and hold max sum and int array is our solution :)Anonymousnoreply@blogger.com