Comments for DoctorInterview http://doctorinterview.com Online Interview Training Site Wed, 19 Jan 2011 10:48:22 +0000 hourly 1 http://wordpress.org/?v=3.0.4 Comment on Sign extending from a constant bit width program by social workers http://doctorinterview.com/algorithmscoding/sign-extending-from-a-constant-bit-width-program/#comment-2972 social workers Wed, 19 Jan 2011 10:48:22 +0000 http://doctorinterview.com/index.html/?p=222#comment-2972 Terrific work! This is the type of information that should be shared around the web. Shame on the search engines for not positioning this post higher! Terrific work! This is the type of information that should be shared around the web. Shame on the search engines for not positioning this post higher!

]]> Comment on How will you find the median of a BST by Miami caterer http://doctorinterview.com/algorithmscoding/how-will-you-find-the-median-of-a-bst/#comment-2966 Miami caterer Wed, 19 Jan 2011 03:51:37 +0000 http://doctorinterview.com/index.html/?p=204#comment-2966 I am just a big fan of this website , It assisted me a lot to meet the right information about healthy modus vivendi. I am just a big fan of this website , It assisted me a lot to meet the right information about healthy modus vivendi.

]]> Comment on Inheritance by Breakout Traffic http://doctorinterview.com/cc-mixed/inheritance/#comment-2960 Breakout Traffic Tue, 18 Jan 2011 20:34:35 +0000 http://doctorinterview.com/index.html/?p=343#comment-2960 <strong>My Millionaire Mentor 2011...</strong> Maintain up the great function mate. This weblog submit exhibits how nicely you comprehend and know this subject.... My Millionaire Mentor 2011…

Maintain up the great function mate. This weblog submit exhibits how nicely you comprehend and know this subject….

]]> Comment on You are given a very large number N of points (x,y,z) in 3D space. You have to find out the k points which are closest to the origin i.e. (0, 0, 0). You have to do it in the most efficient way. (Sorting takes O(nlgn) and apparently there is a much better solution). Distance of P=(x,y,z) from origin is D=sqrt(x*x + y*y + z*z) by consummate.ashu http://doctorinterview.com/algorithmscoding/you-are-given-a-very-large-number-n-of-points-xyz-in-3d-space-you-have-to-find-out-the-k-points-which-are-closest-to-the-origin-ie-0-0-0-you-have-to-do-it-in-the-most-efficient-way-sorti/#comment-2947 consummate.ashu Mon, 17 Jan 2011 21:42:15 +0000 http://doctorinterview.com/index.html/?p=323#comment-2947 The old blog was good to follow. But this new theme sucks and due to this dark images questions/answers are unreadable. The old blog was good to follow. But this new theme sucks and
due to this dark images questions/answers are unreadable.

]]> Comment on Given a dart board of radius `r’, and if a dart is thrown on the board which always falls inside assuming uniform distribution, find the expected distance from the center for the point where the dart lands by TIFTSHAHTHOCK http://doctorinterview.com/algorithmscoding/given-a-dart-board-of-radius-r-and-if-a-dart-is-thrown-on-the-board-which-always-falls-inside-assuming-uniform-distribution-find-the-expected-distance-from-the-center-for-the-point-where-the-dart/#comment-2943 TIFTSHAHTHOCK Mon, 17 Jan 2011 10:40:29 +0000 http://doctorinterview.com/index.html/?p=331#comment-2943 11920.....70627 11920…..70627

]]> Comment on Simulate doubly linked list using single pointer by Bishal-Nath http://doctorinterview.com/algorithmscoding/simulate-doubly-linked-list-using-single-pointer/#comment-2931 Bishal-Nath Sun, 16 Jan 2011 16:53:33 +0000 http://doctorinterview.com/index.html/?p=329#comment-2931 what you dint get? Question or the solution? what you dint get? Question or the solution?

]]> Comment on Simulate doubly linked list using single pointer by kiran http://doctorinterview.com/algorithmscoding/simulate-doubly-linked-list-using-single-pointer/#comment-2930 kiran Sun, 16 Jan 2011 16:50:04 +0000 http://doctorinterview.com/index.html/?p=329#comment-2930 I didn't get the idea. Can you explain me with an example ? I didn’t get the idea. Can you explain me with an example ?

]]> Comment on Guest Book by WikiFunna http://doctorinterview.com/guest-book/#comment-2912 WikiFunna Sun, 19 Dec 2010 14:14:39 +0000 http://doctorinterview.com/index.html/?page_id=5#comment-2912 Did you know that USA and Europe blocked Wikileaks? What do you think about it? Thanks Did you know that USA and Europe blocked Wikileaks? What do you think about it?
Thanks

]]> Comment on Share Question by Ganesh Yadav http://doctorinterview.com/share-question/#comment-2911 Ganesh Yadav Fri, 19 Nov 2010 11:57:40 +0000 http://doctorinterview.com/index.html/?page_id=369#comment-2911 insert a another link list before the given node pointer, ex. sorce 1->2->3->4->5->NULL | pointer points | and insert the before of the pointer Ans 1->2->9->8->7->6->3->4->5->NULL insert a another link list before the given node pointer,
ex.

sorce
1->2->3->4->5->NULL
|
pointer points |
and insert the before of the pointer

Ans
1->2->9->8->7->6->3->4->5->NULL

]]> Comment on You are given with an array of integer and the length of array. Now u have to find an index i such that a(i)=i; O(logn)sol is fine if it(index i) exits. But if there is no such index you are unnecessarily checking it in O(logn) by Rajnish http://doctorinterview.com/algorithmscoding/you-are-given-with-an-array-of-integer-and-the-length-of-array-now-u-have-to-find-an-index-i-such-that-aii-olognsol-is-fine-if-itindex-i-exits-but-if-there-is-no-such-index-you-are-unnecessa/#comment-2910 Rajnish Fri, 19 Nov 2010 04:44:50 +0000 http://doctorinterview.com/index.html/?p=333#comment-2910 Yes, the algo. u given(Assuming sorted) is of order O(n). I do'nt think it is possible in O(log n) time, because the array can have more then 1 element of same value(held consecutively because array is sorted), so we can't decide which side to go. Thanks Yes, the algo. u given(Assuming sorted) is of order O(n). I do’nt think it is possible in O(log n) time, because the array can have more then 1 element of same value(held consecutively because array is sorted), so we can’t decide which side to go.
Thanks

]]>