tag:blogger.com,1999:blog-34173777.post7102961310151102816..comments2023-11-08T12:43:08.928-08:00Comments on DeeKaying @ Pinterest: Google Interview Questions and the Google Campus Interview Process 2011Divye Kapoorhttp://www.blogger.com/profile/05987327171759168375noreply@blogger.comBlogger8125tag:blogger.com,1999:blog-34173777.post-30484314706676166352013-07-13T23:47:17.378-07:002013-07-13T23:47:17.378-07:00Sorry, My bad.
Previous comment was wrong !
Di...Sorry, My bad. <br /><br />Previous comment was wrong ! <br /><br />Divye, Can you please tell me how to do it in O(1) ? I found a solution in O(log n). <br /><br />Thanks. Anonymoushttps://www.blogger.com/profile/11232776615158405346noreply@blogger.comtag:blogger.com,1999:blog-34173777.post-21557988560047975432013-07-13T10:59:05.435-07:002013-07-13T10:59:05.435-07:00Hi Rohit,
As given array is already sorted, You ...Hi Rohit, <br /><br />As given array is already sorted, You just need to compare first element with middle element and middle element with last element. <br /><br />If any of these two comparison results in true then you found your element which is present n/2 times. otherwise not. <br /><br />Hope it help. :)Anonymoushttps://www.blogger.com/profile/11232776615158405346noreply@blogger.comtag:blogger.com,1999:blog-34173777.post-16676338414742896402013-06-10T09:43:09.656-07:002013-06-10T09:43:09.656-07:00Hi Divye bro,
Thanks for such a wonderful and i...Hi Divye bro,<br /><br /> Thanks for such a wonderful and informative post. I have only one question. I have been selected for M.tech CSE in IIT Madras. But I'm worried as my B.Tech CGPA is only 6.9/10. But you have mentioned that 7.0 was the eligibility cutoff for B.Tech. Does that B.Tech eligibility cutoff, apply only for students studying B.Tech at the time of interview, or even for M.Tech students.<br /><br />P.S. What I'm trying to ask is that, for M.Tech students, will they see both B.Tech CGPA and M.Tech CGPA for eligibility. Or will they only see M.Tech CGPA?<br /><br />This is really bothering me bro. You are one of my role models whom I'm trying to follow. So, please answer it bro.Rohitnoreply@blogger.comtag:blogger.com,1999:blog-34173777.post-10594155810271148952012-06-05T22:08:45.952-07:002012-06-05T22:08:45.952-07:00Hi Divye,
Thanks for your post. It is very infor...Hi Divye, <br /><br />Thanks for your post. It is very informative ! I am not able to figure out a solution for the credit card problem. Also I dont understand why you chose m = 13. If you dont have a solution which you can email me, I would really appreciate a couple of quick pointers to help solve this DP problem. thanks !<br /><br />-NehabeingNehahttps://www.blogger.com/profile/12911858722001001358noreply@blogger.comtag:blogger.com,1999:blog-34173777.post-23200092178421891162012-05-29T02:46:43.496-07:002012-05-29T02:46:43.496-07:00Dude can you help me with question no 15,(Given an...Dude can you help me with question no 15,(Given an sorted array, what is the complexity of finding weather a number is present n/2 times or not.)<br /><br />since you have given O(1) as answer,it should be straight-forward..<br /><br />what I thought was using binary search find location of the first number greater than given no and first number less. so O(2*log(n))<br /><br />I also went through a copule of forums for it (geeksforgeeks sort of ) but no luck :(Anonymoushttps://www.blogger.com/profile/11052679117955263378noreply@blogger.comtag:blogger.com,1999:blog-34173777.post-83262586823107663592010-12-14T03:29:48.105-08:002010-12-14T03:29:48.105-08:00The visit was useful. Content was really very info...The visit was useful. Content was really very informative. From www.singaporeflowershop.com/Exclusive_Gifts.aspRITAhttps://www.blogger.com/profile/15689096772807219394noreply@blogger.comtag:blogger.com,1999:blog-34173777.post-78773205023322583852010-12-07T04:52:19.892-08:002010-12-07T04:52:19.892-08:00The visit was useful. Content was really very info...The visit was useful. Content was really very informative. From www.giftflowersusa.com/gift_hamper_to_usa.aspgiftflowersusahttps://www.blogger.com/profile/00464572691758151968noreply@blogger.comtag:blogger.com,1999:blog-34173777.post-27519089776994306682010-12-04T02:13:11.194-08:002010-12-04T02:13:11.194-08:00The visit was useful. Content was really very info...The visit was useful. Content was really very informative. From www.expressgiftbasketsusa.com.Anonymousnoreply@blogger.com