tag:blogger.com,1999:blog-32064785.post5101496301123753339..comments2024-03-18T15:54:10.208+05:30Comments on Freshers Interviews: Google Top Interview Puzzleschaitanyahttp://www.blogger.com/profile/05855949584266440305noreply@blogger.comBlogger88125tag:blogger.com,1999:blog-32064785.post-28479162102228514882024-03-01T12:19:36.572+05:302024-03-01T12:19:36.572+05:30This blog offers insightful puzzles for Google int...This blog offers insightful puzzles for Google interviews, enhancing problem-solving skills. It's a valuable resource for aspiring candidates. For addiction rehabilitation, check out Vikalp Rehab, a leading <a href="https://www.vikalprehab.com/rehabilitation-centre.html" rel="nofollow">rehabilitation centre</a> near me.<br />Blogshttps://www.blogger.com/profile/17061312606056268799noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-71356872473584277902023-12-11T17:24:07.543+05:302023-12-11T17:24:07.543+05:30The difference mass vs weight lies in their fundam...The difference <a href="https://www.88tuition.com/resource/mass_vs_weight_explained_psle_science" rel="nofollow">mass vs weight</a> lies in their fundamental characteristics. Mass is a measure of the amount of matter in an object and is typically constant regardless of the object's location. online tuition classeshttps://www.blogger.com/profile/10389844492461672158noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-17303968026080155952023-05-29T13:56:40.316+05:302023-05-29T13:56:40.316+05:30This comment has been removed by the author.Assignment Help Onlinehttps://www.blogger.com/profile/12330032228692546644noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-4231062806320862842022-10-22T11:35:51.946+05:302022-10-22T11:35:51.946+05:30I want to appreciate you for the efforts that you ...I want to appreciate you for the efforts that you have put in writing this blog. More knowledge with simpler words. Being a content writer, I really like the quality of the content. I also have a team of academic writers including subject matter experts that provides the <a href="https://www.sampleassignment.com/us/architecture-homework-help.html" rel="nofollow">Architecture Homework Help </a>for students looking for the online assignment help.Lucas Lamarhttps://www.blogger.com/profile/09530216342525245878noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-76554081229068182302016-04-22T12:37:40.200+05:302016-04-22T12:37:40.200+05:30I really appreciate this blog. its very beneficial...I really appreciate this blog. its very beneficial for all. Find more Java Developer jobs here - <br /><a href="https://www.universejobs.com/jobs/advance_search" rel="nofollow">Visit Here</a>Anonymoushttps://www.blogger.com/profile/11609192265407950442noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-10385063842277595892015-08-14T22:21:51.445+05:302015-08-14T22:21:51.445+05:30Thank you for such a wonderful Information !!
Her...Thank you for such a wonderful Information !!<br /><b> Here is a list of Top LINUX INTERVIEW QUESTIONS<br><br /><a href="http://linux.amitmaheshwari.in/2015/07/veritas-cluster-interview-questions.html" rel="nofollow">Veritas Cluster Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/07/commands-used-in-redhat-cluster-suite.html" rel="nofollow">Redhat Cluster Suite Commands </a><br><br /><a href="http://linux.amitmaheshwari.in/2015/07/samba-server-interview-questions.html" rel="nofollow">SAMBA Server Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/linux-ftp-vsftpd-interview-questions.html" rel="nofollow">Linux FTP vsftpd Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/ssh-interview-questions-and-answers.html" rel="nofollow">SSH Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/apache-interview-questions.html" rel="nofollow">Apache Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/nagios-interview-questions.html" rel="nofollow">Nagios Interview questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2014/11/iptables-tutorials.html" rel="nofollow">IPTABLES Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/ldap-server-interview-questions.html" rel="nofollow">Ldap Server Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/lvm-interview-questions.html" rel="nofollow">LVM Interview questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/sendmail-server-interview-questions.html" rel="nofollow">Sendmail Server Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/yum-interview-questions-and-answers.html" rel="nofollow">YUM Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/yum-interview-questions-and-answers.html" rel="nofollow">NFS Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/08/tcpdump-command-examples-usages.html" rel="nofollow"> Tcpdump Command Examples & Usages </a><br><br /><a href="http://linux.amitmaheshwari.in/2015/08/example-of-yum-command-in-rhel-linux.html" rel="nofollow"> Example of YUM Commands </a><br><br />Read More at :- <a href="http://linux.amitmaheshwari.in" rel="nofollow">Linux Troubleshooting </a></b><br />Domain KINGhttps://www.blogger.com/profile/14652297000553299207noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-37479558492316803912014-01-20T04:51:34.813+05:302014-01-20T04:51:34.813+05:30never mind. my bad. wasn't thinking when i ask...never mind. my bad. wasn't thinking when i asked the question. isomorphhttps://www.blogger.com/profile/11359946465217889610noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-47007920484365252542014-01-19T06:02:35.198+05:302014-01-19T06:02:35.198+05:30how is your solution O(n)? isn't it O(n^2) ins...how is your solution O(n)? isn't it O(n^2) instead?isomorphhttps://www.blogger.com/profile/11359946465217889610noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-51391286175552436362012-01-30T16:00:35.599+05:302012-01-30T16:00:35.599+05:30really good and helpful information. I like it. Th...really good and helpful information. I like it. Thank you for sharing.<br /><br /><a href="http://www.campusrecruitments.com/Bank/bankupcomingexams.html" rel="nofollow">Upcoming Bank Exams</a>Educationhttps://www.blogger.com/profile/15632089902231469280noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-87152123260844936312011-10-17T20:07:04.809+05:302011-10-17T20:07:04.809+05:30question 13th:
create a suffix tree on the bigger...question 13th:<br /><br />create a suffix tree on the bigger string O(n)<br /><br />then search for smaller substring in the formed suffix tree. for each sub-string search takes O(L)(L-lenght of the substring) time. <br />so overall complexity becomes O(n+L*m)Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-32064785.post-11226354457870252622011-06-29T08:01:59.428+05:302011-06-29T08:01:59.428+05:30Design a stack. We want to push, pop, and also, re...Design a stack. We want to push, pop, and also, retrieve the minimum element in constant time.<br />http://anandtechblog.blogspot.com/2011/06/all-stack-operation-in-constant-time-o1.htmlAnandhttps://www.blogger.com/profile/14013737904363005349noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-76769264983373086232011-06-29T07:48:16.446+05:302011-06-29T07:48:16.446+05:30Write a function to find the middle node of a sing...Write a function to find the middle node of a single link list.<br />http://anandtechblog.blogspot.com/2010/08/middle-element-of-linked-list.htmlAnandhttps://www.blogger.com/profile/14013737904363005349noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-77752943771911057202011-06-29T07:45:19.791+05:302011-06-29T07:45:19.791+05:30Given a set of coin denominators, find the minimum...Given a set of coin denominators, find the minimum number of coins to give a certain amount of change.<br />http://anandtechblog.blogspot.com/2010/06/give-minimum-number-of-coins_19.htmlAnandhttps://www.blogger.com/profile/14013737904363005349noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-2569872727855162452011-06-29T07:41:08.126+05:302011-06-29T07:41:08.126+05:30How do you find out the fifth maximum element in a...How do you find out the fifth maximum element in an Binary Search Tree in efficient manner.<br /><br />Similar concept can be used to find fifth MAXIMUM<br />http://anandtechblog.blogspot.com/2010/12/find-kth-min-element-of-tree.htmlAnandhttps://www.blogger.com/profile/14013737904363005349noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-25183879476086289152011-06-29T07:38:39.899+05:302011-06-29T07:38:39.899+05:30# Given a Binary Tree, Programmatically you need t...# Given a Binary Tree, Programmatically you need to Prove it is a Binary Search Tree<br />Hint: Some kind of pointer handling with In Order Traversal - anybody in for<br />writing some code<br /><br />http://anandtechblog.blogspot.com/2010/12/validate-binary-search-tree-google.htmlAnandhttps://www.blogger.com/profile/14013737904363005349noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-69863263315738027772011-06-29T07:26:32.247+05:302011-06-29T07:26:32.247+05:30There is an array A[N] of N numbers. You have to c...There is an array A[N] of N numbers. You have to compose an array Output[N] such that Output[i] will be equal to multiplication of all the elements of A[N] except A[i]. For example Output[0] will be multiplication of A[1] to A[N-1] and Output[1] will be multiplication of A[0] and from A[2] to A[N-1].<br />http://anandtechblog.blogspot.com/2010/09/given-array-of-numbers-replace-each.htmlAnandhttps://www.blogger.com/profile/14013737904363005349noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-41197277183581298172011-05-18T00:32:55.677+05:302011-05-18T00:32:55.677+05:30Solution 1,5 in Java
public static void main(Strin...Solution 1,5 in Java<br />public static void main(String arg[])<br />{<br />int a[]={1,2,3,4,5};<br />int output[]={1,1,1,1,1};<br />int left=1;<br />int right=1;<br />int n= a.lenght;<br />for(int i=0;i<;i++)<br />{<br />output[i]=output[i]*left;<br />output[n-i-1]=output[n-i-1]*right;<br />left=a[i]*left;<br />right=a[i]*right;<br />}<br />}<br />complexity is O(n) i.e. O(5)Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-32064785.post-562590550913348272011-03-28T07:15:51.353+05:302011-03-28T07:15:51.353+05:30Q:14 It may fail in below case..!!
10
...Q:14 It may fail in below case..!!<br /><br /> 10<br /> /<br /> 4<br /> \<br /> 15<br /><br />I think below solution may work:<br /><br />bool isthisBST(nodeptr root)<br />{<br />return isthisBSTUtil(root,INT_MIN, INT_MAX);<br />}<br /><br /><br />int isthisBSTUtil(nodeptr root, int min, int max)<br />{<br />if(root == NULL) return true; //empty tree is a bst<br />if(root-data < min || root->data >max) return false;<br /><br /><br />return (isthisBSTUtil(root->left, min, root->data) || isthis BSTUtil(root->right,root->data, max);<br />}Rajan Dhabaliahttp://www.google.comnoreply@blogger.comtag:blogger.com,1999:blog-32064785.post-33181196842605003682011-01-18T21:08:06.953+05:302011-01-18T21:08:06.953+05:30For question #16 (and #22):
There are N*(N-1)/2 ...For question #16 (and #22): <br /><br />There are N*(N-1)/2 possibilities to choose from for merging any two of the N companies, leaving (N-1) companies. Then the game begins again, starting with (N-1) companies. Thus the total number c of merging possibilities is:<br /><br />c = N*(N-1)/2 * (N-1)*(N-2)/2 * ... * (N-(N-3))*(N-(N-2))/2.<br /><br />which is (in pseudo code):<br /><br />c = 1<br />for i = 0 ... (N-3)<br /> c = c * (N-i) * (N-i-1) / 2<br />endAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-32064785.post-64796195892486734742010-12-06T15:38:11.139+05:302010-12-06T15:38:11.139+05:30These are great questions! Thanks for sharing..
C...These are great questions! Thanks for sharing..<br /><br /><a href="http://www.commoninterviewquestions.org/" rel="nofollow">Common Interview Questions</a>Unknownhttps://www.blogger.com/profile/15137802134496628459noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-73232888635063189572010-11-27T15:22:03.446+05:302010-11-27T15:22:03.446+05:30To Solve Problem 2:
i.e. How to get K random numb...To Solve Problem 2: <br />i.e. How to get K random numbers from N number linked list.<br />http://www.techuser.net/randpermgen.htmlAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-32064785.post-79797835307435073162010-11-23T12:22:20.504+05:302010-11-23T12:22:20.504+05:30These questions are very good in standerd and i th...These questions are very good in standerd and i think everyone should try to solve them.<br />"Very Good Quetions"deepak 'sorted'http://www.i.dont.haveurl.comnoreply@blogger.comtag:blogger.com,1999:blog-32064785.post-52663636341154579172010-10-14T17:30:37.771+05:302010-10-14T17:30:37.771+05:30For Q1:
assume we have two more temp arrays P[N]=...For Q1:<br />assume we have two more temp arrays P[N]={1} and RP[N]={1}<br />P[0]=A[0]; RP[N-1] = A[N-1];<br />for(i=1;i<N;i++)<br /> P[i] *= P[i-1]* A[i];<br />for(i=N-2;i;i--)<br /> RP[i]*= RP[i+1]*A[i];<br />//finally<br />Output[0] = 1 * RP[1];<br />for(i=1;i<N-1;i++)<br /> Output[i] = P[i-1] * RP[i+1];<br />Output[N-1] = P[N-2] * 1;Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-32064785.post-6001691977072989872010-09-06T15:58:38.237+05:302010-09-06T15:58:38.237+05:30thanq very much for this collection,.. :)thanq very much for this collection,.. :)chandrahasnoreply@blogger.comtag:blogger.com,1999:blog-32064785.post-61030418289686109212010-09-06T15:54:37.188+05:302010-09-06T15:54:37.188+05:30For Q 11,..
consider the Line AB and draw a line t...For Q 11,..<br />consider the Line AB and draw a line through C parallel to line AB,..now drop a perpendicular from point C to line AB,...so now we can draw a line through the midpoint of the perpendicular and parallel to line AB,..which is equidistant from all points A,B,C..,...so following the same stat with other two lines BC and AC gives total THREE lines,...equidistant from A,B,C.chandrahasnoreply@blogger.com