http://geeksforgeeks.org/forum/ Coming together of Geeks en-US Tue, 07 Feb 2012 02:33:01 +0000 http://bbpress.org/?v=1.0.2 q http://geeksforgeeks.org/forum/search.php http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-fresher-about-algorithms-29#post-30012 Fri, 30 Sep 2011 16:53:33 +0000 lalit 30012@http://geeksforgeeks.org/forum/ <p>implement a func node *(char *word){}<br /> wich returns a link list of words dat are anagrams with the input word..if no anagrams found return NULL and add that word to the link list</p> <p>given structure of list as<br /> struct node {<br /> struct node *next;<br /> char val[101];<br /> }; </p> http://geeksforgeeks.org/forum/topic/data-structures-amazon#post-36408 Mon, 06 Feb 2012 21:43:42 +0000 abzx12@gmail.com 36408@http://geeksforgeeks.org/forum/ <p>Given numbers 1 to 1000, suggest a data structure to store them such that following operations can be executed in constant time:<br /> 1- insertion,<br /> 2- deletion,<br /> 3- searching,<br /> 4- get_any_number (means return any number if present in the data-structure otherwise return -1).</p> <p>NOTE: Numbers are unique in the data structure. </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-about-algorithms-90#post-31518 Thu, 03 Nov 2011 14:26:28 +0000 t5 31518@http://geeksforgeeks.org/forum/ <p>for a given file(80 column and 100 lines) find in how many lines a word occur. the answer is like: </p> <p>"the" in line 5,8,23.<br /> "name" in line 45,23...</p> <p>for all the words. </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-about-arrays-37#post-31340 Mon, 31 Oct 2011 08:49:29 +0000 lokesh 31340@http://geeksforgeeks.org/forum/ <p>Given two arrays, one is 1D array and other is 2D array. U need to find out whether 2D array contains the subset of 1D array. The elements of 1D array not neccessary present in the same row it can be either on the up or down but should be continuous in the 2D array. </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-about-linked-lists-12#post-30288 Fri, 07 Oct 2011 23:21:14 +0000 sudhir 30288@http://geeksforgeeks.org/forum/ <p>Perform inplace(we cant create new node)merge of two sorted linked lists. </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-about-data-structure-18#post-30285 Fri, 07 Oct 2011 23:21:09 +0000 sudhir 30285@http://geeksforgeeks.org/forum/ <p>What kind a data structure will you use to implement an Instant Search feature. </p> http://geeksforgeeks.org/forum/topic/how-to-find-out-the-position-of-a-msb-in-a-number#post-36403 Mon, 06 Feb 2012 19:16:13 +0000 PsychoCoder 36403@http://geeksforgeeks.org/forum/ <p>Running time as faster as you can. Logarithmic time expected !!</p> <p>Do not use in built log function or __builtin_clz </p> http://geeksforgeeks.org/forum/topic/largest-palindrome-in-a-string#post-369 Sat, 27 Mar 2010 11:28:52 +0000 Tushar Roy 369@http://geeksforgeeks.org/forum/ <p>How to find the largest palindrome in the string?? </p> http://geeksforgeeks.org/forum/topic/tree-helical-order-traversal#post-36400 Mon, 06 Feb 2012 16:24:40 +0000 anji.swe 36400@http://geeksforgeeks.org/forum/ <p>Any body, give a program / logic to traverse a tree in helical order</p> <p>ex:<br /> tree:<br /> 1<br /> 2 3<br /> 4 5 6 7 </p> <p>Out Put:<br /> 1 2 3 7 6 5 4 or 1 3 2 4 5 6 7 </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-about-arrays-39#post-34469 Thu, 15 Dec 2011 22:19:45 +0000 dheeraj 34469@http://geeksforgeeks.org/forum/ <p>Given an array-based heap on n elements and a real number x, efficiently determine whether the kth smallest element in the heap is greater than or equal to x. Your algorithm should be O(k) in the worst-case, independent of the size of the heap. </p> http://geeksforgeeks.org/forum/topic/precedence-1#post-35944 Sat, 21 Jan 2012 18:34:46 +0000 k53 35944@http://geeksforgeeks.org/forum/ <p>Please explain the associativity and order of execution in this statement<br /> b= a + ++b + (a-b);<br /> () has the highest precedence. but a-b is not executed first..<br /> It is just executed from left to right </p> http://geeksforgeeks.org/forum/topic/amazon-banglore-online-written-3#post-36269 Thu, 26 Jan 2012 13:17:31 +0000 gupta5035 36269@http://geeksforgeeks.org/forum/ <p>You are given a function printKDistanceNodes which takes in a root node of a binary tree, a start node and an integer K. Complete the function to print the value of all the nodes (one-per-line) which are a K distance from the given start node in sorted order. Distance can be upwards or downwards. </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-0-2-years-about-algorithms-17#post-34305 Tue, 13 Dec 2011 08:49:01 +0000 gopal 34305@http://geeksforgeeks.org/forum/ <p>write an algorithm finding the no.of one bits from 1 to n,for given any n value.<br /> complexity should be good<br /> example:<br /> 1=1<br /> 2=10<br /> 3=11<br /> 4=100<br /> 5=101<br /> 6=110<br /> .<br /> .<br /> if n=3 then ur answer is 4<br /> if n=6 then ur answer is 9</p> <p>Interviewer is looking for an algo in O(log n)time complexity </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-about-algorithms-92#post-31627 Sat, 05 Nov 2011 20:05:36 +0000 Rohit 31627@http://geeksforgeeks.org/forum/ <p>Get the depth of a tree without using recursion </p> http://geeksforgeeks.org/forum/topic/amazon-placement#post-36391 Mon, 06 Feb 2012 03:08:48 +0000 saurabhgeek 36391@http://geeksforgeeks.org/forum/ <p>You are given a linked list. Apart from the normal "Next" pointer, there is one more pointer(random ptr) in each node which points to some random node of the list. How will you create a clone of such a list? (In less than O(n^2)) </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-0-2-years-7#post-35245 Mon, 02 Jan 2012 14:58:11 +0000 Name: 35245@http://geeksforgeeks.org/forum/ <p>You are given a function printMostFrequentWords which takes in an array of strings. You are required to print a list of all the letters that occurred with the highest frequency in each line of the array, followed by the frequency.<br /> The list of letters should be an alphabetical list of upper case letters followed by an alphabetical list of lower case letters.<br /> Sample Test Cases: </p> <p>Input #00:<br /> When riding your bicycle backwards down a one-way street, if the<br /> wheel falls of a canoe, how many ball bearings does it take to fill<br /> up a water buffalo?<br /> Hello Howard.</p> <p>Output #00:<br /> e 6<br /> al 7<br /> a 3<br /> Hlo 2 </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-fresher-about-arrays-9#post-35674 Fri, 13 Jan 2012 09:17:37 +0000 rahul 35674@http://geeksforgeeks.org/forum/ <p>Given an array (length n), we need to find the subarray (length k) such that the sum of the first j elements of the subarray equals the sum of the remaining (k-j) elements of the subarray.<br /> For e.g.<br /> Array: 2,2,13,4,7,3,8,12,9,1,5<br /> Output: 4,7,3,8,12,9,1 [4+7+3+8=12+9+1]<br /> Could this be done with a complexity better than O(n^3) </p>