/questions/cats Top Interview questions and their answers Tue, 13 May 2008 04:43:40 +0000 http://backend.userland.com/rss092 en How do you apply Binary Search on 2D array supposed you have 2D array with integers sorted both horizontally and vertically. If you find any occurrence of the value you are looking for you return true else false. What is the complexity? For example the 2D array could look like the ... /questions/cats/index.php/algorithm/2008/05/12/binary-search-on-2d-array-by-ruby How to remove extra bracket from expressions,i.e  ((((A+B))*C))? most optimized answer?? /questions/cats/index.php/algorithm/2008/05/06/binary-search-tree-by-aman-2 How to find median of a BST?   constraint: without storing it in  a linear data structure by inorder traversal?  /questions/cats/index.php/algorithm/2008/05/06/binary-search-tree-by-aman You have borrowed money from your friend George.  But now, George wants his money back.  So you go to your other friend Frank and he writes you a check for the amount you owe George.  You make your way to the bank and give the check to the teller.  He ... /questions/cats/index.php/analytical/2008/05/06/mixed-dollars-and-coins-by-greg-gavarian Given an N x M two dimensional array of integers where all rows and columns are sorted in ascending order, write a function that can determine if a certain value exists in the array. /questions/cats/index.php/algorithm/2008/05/06/sorted-two-dimensional-array-search-by-tron-thomas You have 12 identical looking coins. Only one coin out of the 12 coins is definitely bad, it can be heavier or lighter, we don't know at this stage.   You have a ( two ) pan balance and are allowed only three tries. You can use any mix of coins in ... /questions/cats/index.php/analytical/2008/05/06/coins-and-pan-balance-12-coins-three-tries-by-rafat-malik-jamal what is meant by structure ? application of structure? difference between structure and unions? /questions/cats/index.php/fundamental/2008/05/06/stucture-by-sivakumar Here's one I was asked during my interview: - binary tree, nodes, each node has an ID - root node of the tree structure node {             int id;             node * left;             node * right; } - problem: given node id 1, and node id 2, determine the lowest common ancestor of these 2 nodes             - input: id1, id2, root             - ... /questions/cats/index.php/microsoft_google/2008/05/06/binary-tree-lca-by-kevin Create an algorithm that can store 100 business cards and return the information quickly(no external databases), keeping in mind that the company would want to increase the no. of cards later ! /questions/cats/index.php/algorithm/2008/05/06/business-cards-by-jerome How do you plan your day? /questions/cats/index.php/introductory/2008/05/06/introductory-question-by-kumar