techinterviewz.blogspot.com

techbrother.blogspot.com

Tech Brothers: February 2008

http://techbrother.blogspot.com/2008_02_01_archive.html

Cracking Interviews Exposed Here. Enter your search terms. Hat color problem- most asked question in interviews. Http:/ en.wikipedia.org/wiki/Prisoners and hats puzzle. Links to this post. Two tribes one always tells true other false. It means Bryan is married and Alan's status is unclear. Links to this post. Design a stack which have O(1) time complexity for finding the minimum element? We can think of two different solutions -. For ex: Let us assume the following numbers which are pushed on to the stack.

techbrother.blogspot.com

Tech Brothers: December 2007

http://techbrother.blogspot.com/2007_12_01_archive.html

Cracking Interviews Exposed Here. Enter your search terms. Deleting all your perforce workspaces. Four people crossing the bridge optimally. When two people walk and their speeds are different then the time taken(cost) to cover some distance will be the time taken by slowest of the two. First take 1, 2 to side2 cost = 2. Get 2 back to side1 cost = 2. Then take 5,10 to side2 cost = 10. Get 1 back to side 1 cost = 1. Get 1 and 2 back to side2 cost =2. Total cost = 17. Links to this post. Links to this post.

techbrother.blogspot.com

Tech Brothers: November 2007

http://techbrother.blogspot.com/2007_11_01_archive.html

Cracking Interviews Exposed Here. Enter your search terms. Deleting all your perforce workspaces. There are 3 ants at 3 corners of a triangle, they randomly start moving towards another corner. What is the probability that they don’t collide? Prob of colliding is. 1st and 2nd moving towards each other 2nd and 3rd moving towards each other 3rd and 1st moving towards each other. 1/2)* (1/2) (1/2)* (1/2) (1/2)* (1/2) = 3/4. Probability of not colliding = 1- 3/4 = 1/4. Links to this post. Links to this post.

techbrother.blogspot.com

Tech Brothers: There are 25 horses and only 5 tracks. No of matches to find top 3 horses.

http://techbrother.blogspot.com/2008/03/there-are-25-horses-and-only-5-tracks.html

Cracking Interviews Exposed Here. Enter your search terms. Deleting all your perforce workspaces. There are 25 horses and only 5 tracks. No of matches to find top 3 horses. There are 25 horses and only 5 tracks. So only 5 horses can run the race at a time. How many minimum no of races should be conducted to find the 3 best horses? The answer is 7. Round 1: Take 5 horses at a time. 5 winners of each race will go to round2. Round 2: Winner of this will be top most horse.(call it W1). H1: 2nd horse of round2.

techbrother.blogspot.com

Tech Brothers: March 2008

http://techbrother.blogspot.com/2008_03_01_archive.html

Cracking Interviews Exposed Here. Enter your search terms. Deleting all your perforce workspaces. There are 25 horses and only 5 tracks. No of matches to find top 3 horses. There are 25 horses and only 5 tracks. So only 5 horses can run the race at a time. How many minimum no of races should be conducted to find the 3 best horses? The answer is 7. Round 1: Take 5 horses at a time. 5 winners of each race will go to round2. Round 2: Winner of this will be top most horse.(call it W1). H1: 2nd horse of round2.

techbrother.blogspot.com

Tech Brothers: Hat color problem--most asked question in interviews..

http://techbrother.blogspot.com/2008/02/hat-color-problem-most-asked-question.html

Cracking Interviews Exposed Here. Enter your search terms. Hat color problem- most asked question in interviews. Http:/ en.wikipedia.org/wiki/Prisoners and hats puzzle. Given a singly linked list, find the middle of the. Given a single linked list write a function to swa. Given two sorted linked lists, write a function to. Remove duplicates from a linked list? Under what circumstances can one delete an element. Given a singly linked list, determine whether it c. To see the related document.

techbrother.blogspot.com

Tech Brothers: December 2008

http://techbrother.blogspot.com/2008_12_01_archive.html

Cracking Interviews Exposed Here. Enter your search terms. Alternative earnings through internet. Modern day students need not depend on their parents or elders for the pocket money. With the widespread use of internet there are lot of opportunities available for making money online. There are couple of online survey sites based in india which are providing reward points for filling up simple surveys ( http:/ xcel-onlinesurveys.com? Links to this post. Microsoft livesearch win rewards. Links to this post.

techbrother.blogspot.com

Tech Brothers: January 2008

http://techbrother.blogspot.com/2008_01_01_archive.html

Cracking Interviews Exposed Here. Enter your search terms. Deleting all your perforce workspaces. Reverse each individual word in sentence? Void reversestr(char* str, char* strend). Tmp = *strend;. Strend = *str;. Str = tmp;. Char *wordstart=sentence, *wordstop=sentence;. Char *pSend=sentence,*pSstart =sentence ;. Wordstart = wordstop 2;. Wordstop = wordstart;. Links to this post. Find out if a string is a palindrome? Int end = strlen(str)-1;. For (int i = 0; i. Links to this post. Bool founddup = false;.

techbrother.blogspot.com

Tech Brothers: Alternative earnings through internet.

http://techbrother.blogspot.com/2008/12/alternative-earnings-through-internet.html

Cracking Interviews Exposed Here. Enter your search terms. Deleting all your perforce workspaces. Alternative earnings through internet. Modern day students need not depend on their parents or elders for the pocket money. With the widespread use of internet there are lot of opportunities available for making money online. There are couple of online survey sites based in india which are providing reward points for filling up simple surveys ( http:/ xcel-onlinesurveys.com? Microsoft livesearch win rewards.