http://geeksforgeeks.org/forum/ Coming together of Geeks en-US Tue, 07 Feb 2012 02:25:51 +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-36409 Tue, 07 Feb 2012 00:30:37 +0000 PsychoCoder 36409@http://geeksforgeeks.org/forum/ <p>Use hash - as we are dealing with alphabetic letters. </p> <p>Hash the input word character by character.</p> <p>Use each words in the linked list and compare with the input word using hash table.</p> <p>If they matches - It is the anagram. Otherwise not. </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-36407 Mon, 06 Feb 2012 20:51:30 +0000 PsychoCoder 36407@http://geeksforgeeks.org/forum/ <p>Use trie. </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-about-arrays-37#post-36406 Mon, 06 Feb 2012 20:37:18 +0000 PsychoCoder 36406@http://geeksforgeeks.org/forum/ <p>Is it subset or the whole 1D array? </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-about-linked-lists-12#post-36405 Mon, 06 Feb 2012 20:31:56 +0000 PsychoCoder 36405@http://geeksforgeeks.org/forum/ <p><a href="http://www.geeksforgeeks.org/archives/7740" rel="nofollow">http://www.geeksforgeeks.org/archives/7740</a> </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-about-data-structure-18#post-36404 Mon, 06 Feb 2012 20:22:33 +0000 PsychoCoder 36404@http://geeksforgeeks.org/forum/ <p>I think Here Instant search means "Fetching results"</p> <p>It can be implemented using Trie . </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/page/2#post-36402 Mon, 06 Feb 2012 17:37:36 +0000 PsychoCoder 36402@http://geeksforgeeks.org/forum/ <pre>int longestPalindromSubSeq (char* str) { int **seqMatrix, i, j, s ; int len = strlen(str) , seqlen; seqMatrix = (int **) malloc (sizeof(int*) * len) ; for (i = 0 ; i &lt; len ; i ++ ) { *(seqMatrix+i) = (int *) malloc (sizeof(int) * len) ; } for (i = 0 ; i &lt; len; i ++) { for (j = 0 ; j &lt; len ; j ++) { /*(Each character is a palindrome of length 1)*/ if (i == j) seqMatrix[i][i] = 1 ; else seqMatrix[i][j] = 0 ; } } for (i = 1 ; i &lt; len ; i ++ ) { for ( s = 0 ; s &lt; len-i ; s ++ ) { j = s+i ; seqMatrix[s][j] = computeCost (seqMatrix,str,s,j) ; seqMatrix[j][s] = seqMatrix[s][j]; } } seqlen = seqMatrix[0][len-1] ; free (seqMatrix) ; return seqlen ; } int computeCost (int **seqMatrix, char* seq, int i, int j) { if (i == j) return seqMatrix[i][j] ; if (seq[i] == seq[j]) { if ((j-i)&lt;=1) return j-i ; else return (seqMatrix[i+1][j-1] + 2) ; } return (seqMatrix[i+1][j]&gt;seqMatrix[i][j-1]) ? seqMatrix[i+1][j] : seqMatrix[i][j-1]; }</pre> http://geeksforgeeks.org/forum/topic/tree-helical-order-traversal#post-36401 Mon, 06 Feb 2012 16:34:38 +0000 kartik 36401@http://geeksforgeeks.org/forum/ <p>See <a href="http://www.geeksforgeeks.org/archives/3758" rel="nofollow">http://www.geeksforgeeks.org/archives/3758</a> </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-36399 Mon, 06 Feb 2012 16:13:06 +0000 PsychoCoder 36399@http://geeksforgeeks.org/forum/ <p>An O(k) solution can look at only k elements smaller than x, plus at most O(k)<br /> elements greater than x. Consider the following recursive procedure, called at the<br /> root with i = 1 with count = k:</p> <pre> int heap_compare(priority_queue *q, int k, int count, int x) { if ((count &lt;= 0) || (k &gt; q-&gt;n) return(count); if (q-&gt;q[k] &lt; x) { count = heap_compare(q, pq_young_child(k), count-1, x); count = heap_compare(q, pq_young_child(k)+1, count, x); } return(count); } </pre> <p>If the root of the min-heap is ≥ x, then no elements in the heap can be less than<br /> x, as by definition the root must be the smallest element. This procedure searches<br /> the children of all nodes of weight smaller than x until either (a) we have found<br /> k of them, when it returns 0, or (b) they are exhausted, when it returns a value<br /> greater than zero. Thus it will find enough small elements if they exist.</p> <p><em>But how long does it take? The only nodes whose children we look at are those<br /> &lt; x, and at most k of these in total. Each have at most visited two children, so we<br /> visit at most 3k nodes, for a total time of O(k).</em> </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-about-arrays-39#post-36398 Mon, 06 Feb 2012 15:21:32 +0000 PsychoCoder 36398@http://geeksforgeeks.org/forum/ <pre><strong>QuickSelect: </strong> Given array A of size n and integer k ≤ n, 1. Pick a pivot element p at random from A. 2. Split A into subarrays LESS and GREATER by comparing each element to p as in Quicksort. While we are at it, count the number L of elements going in to LESS. 3. (a) If L = k − 1, then output p. (b) If L &gt; k − 1, output QuickSelect(LESS, k). (c) If L &lt; k − 1, output QuickSelect(GREATER, k − L − 1) </pre> <p><strong> The expected number of comparisons for QuickSelect is O(n)</strong> </p> http://geeksforgeeks.org/forum/topic/precedence-1#post-36397 Mon, 06 Feb 2012 15:17:06 +0000 Abhijeet Deshpande 36397@http://geeksforgeeks.org/forum/ <p>[EDIT]<br /> <strike><br /> Just to be clear. the original C expression has nothing to do with sequence points. As pointed out by Venki, ++ and () fall under same precendence. Hence, they are evaluated from left to right. First the value held in b is incremented. Then it is assigned to b. After which (a-b) is evaluated with new value of b.</strike></p> <p>I am sorry I gave a wrong comment. Even the original code has sequence point violation. I was under the assumption that the binary operation "+" is a sequence point. However, it is not!!!</p> <p>However, the expressions posted by k53 later indeed have sequence point violations. The result is unpredictable.</p> <p>No offense, but do not refer to wikipedia for C fundamentals (or fundamentals of any subject, for that matter) :-) Refer to compiler datasheets (like MSDN) or standard textbooks instead </p> http://geeksforgeeks.org/forum/topic/amazon-banglore-online-written-3#post-36396 Mon, 06 Feb 2012 15:14:37 +0000 javanetbeans 36396@http://geeksforgeeks.org/forum/ <p>#include &lt;iostream&gt;<br /> #include &lt;vector&gt;<br /> using namespace std;</p> <p>vector&lt;int&gt; values;</p> <p>void printNodeAtDistance(node *root, int distance) {<br /> if (root == NULL) return;<br /> if (distance == 0) {<br /> values.push_back(root-&gt;val);<br /> } else {<br /> printNodeAtDistance(root-&gt;left, distance-1);<br /> printNodeAtDistance(root-&gt;right, distance-1);<br /> }<br /> }</p> <p>int getLen(node *move, node *desired, int k) {<br /> if (move == NULL) return -10;<br /> if (move-&gt;val == desired-&gt;val) {<br /> printNodeAtDistance(move, k);<br /> return k-1;<br /> }<br /> int p = getLen(move-&gt;left, desired, k);<br /> if (p == -10) {<br /> p = getLen(move-&gt;right, desired, k);<br /> if (p == 0){<br /> values.push_back(move-&gt;val);<br /> return -10;<br /> }<br /> if (p == -10) return -10;<br /> printNodeAtDistance(move-&gt;left, p-1);<br /> } else if (p &gt;= 0) {<br /> if (p == 0){<br /> values.push_back(move-&gt;val);<br /> return -10;<br /> }<br /> printNodeAtDistance(move-&gt;right, p-1);<br /> }<br /> return p-1;<br /> }</p> <p>void printValues() {<br /> sort(values.begin(), values.end());<br /> for(int j = 0; j &lt; values.size(); j++){<br /> cout &lt;&lt; values[j] &lt;&lt; endl;<br /> }<br /> }</p> <p>void printKDistanceNodes(node *root, node *start, int K){<br /> getLen(root, start, K);<br /> printValues();<br /> }</p> <p>int main()<br /> {<br /> printKDistanceNodes(tree_pointer, start_pointer, K);<br /> } </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-0-2-years-about-algorithms-17#post-36395 Mon, 06 Feb 2012 13:22:24 +0000 PsychoCoder 36395@http://geeksforgeeks.org/forum/ <p>@Narendra Kangralkar : Your code is correct but it is for finding only set-bit count for one number. But the question is different. </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-about-algorithms-92#post-36394 Mon, 06 Feb 2012 13:10:09 +0000 PsychoCoder 36394@http://geeksforgeeks.org/forum/ <pre> int getDepthNoRecursion(node *root) { int depth = 0; int currDepth ; Stack *s ; node *temp ; if(root == NULL) { return 0; } root-&gt;depth = 1; createStack (&amp;s) ; push(&amp;s,root); while(!isEmpty(s)) { temp = pop(&amp;s); curDepth = temp-&gt;depth; if(currDepth &gt; depth) { depth = currDepth; } if(temp-&gt;left ) { temp-&gt;left-&gt;depth = currDepth + 1; push(&amp;s, temp-&gt;left); } if(temp-&gt;right) { temp-&gt;right-&gt;depth = currDepth + 1; push(&amp;s, temp-&gt;right); } } return depth; } typedef struct node { node *left; node *right; int val; int depth = 0; }</pre> http://geeksforgeeks.org/forum/topic/amazon-placement#post-36392 Mon, 06 Feb 2012 04:20:57 +0000 kartik 36392@http://geeksforgeeks.org/forum/ <p>See <a href="http://www.geeksforgeeks.org/archives/1155" rel="nofollow">http://www.geeksforgeeks.org/archives/1155</a> </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-36390 Sun, 05 Feb 2012 21:57:41 +0000 PsychoCoder 36390@http://geeksforgeeks.org/forum/ <p>Create an array of 26 which holds the count of each small letters<br /> And create another an array of 26 which holds the count of each Capital numbers.</p> <pre> For each line from the text Initialize the arrays with all 0 s Extract each letter and check whether it is an alphabet or not. If letter is an alphabet increase the counter of arr[character] depending upon whether it is small or Capital letter. in each letter check the max count if count &gt; max_count max_count = count when all the letters in the line are scanned find all the characters with max_count and print it. </pre> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-fresher-about-arrays-9#post-36389 Sun, 05 Feb 2012 20:08:19 +0000 PsychoCoder 36389@http://geeksforgeeks.org/forum/ <p>@APJ : Your solution is quite nice. </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-fresher-about-trees-12#post-36388 Sun, 05 Feb 2012 18:14:44 +0000 PsychoCoder 36388@http://geeksforgeeks.org/forum/ <p><strong>I think symmetric means comparing the structure of left sub-tree with the right sub-tree.</strong></p> <pre>int isSymmetric (node *list1, node *list2) { int check1, check2 ; if (list1 == NULL &amp;&amp; list2 == NULL) return 1 ; if (list1 &amp;&amp; list2) { check1 = isSymmetric (list1-&gt;left, list2-&gt;right) ; check2 = isSymmetric (list1-&gt;right, list2-&gt;left) ; return check1 &amp;&amp; check2 ; } return 0 ; } </pre> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-fresher-about-algorithms-arrays-4#post-36387 Sun, 05 Feb 2012 17:47:02 +0000 PsychoCoder 36387@http://geeksforgeeks.org/forum/ <p><a href="http://www.geeksforgeeks.org/archives/13209" rel="nofollow">http://www.geeksforgeeks.org/archives/13209</a></p> <p>Nice Solution..</p> <p><strong>Time Complexity: O(n^2)</strong> </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-0-2-years-10#post-36386 Sun, 05 Feb 2012 17:30:39 +0000 PsychoCoder 36386@http://geeksforgeeks.org/forum/ <p><a href="http://www.geeksforgeeks.org/archives/9755" rel="nofollow">http://www.geeksforgeeks.org/archives/9755</a></p> <p><strong>Find duplicates in O(n) time and O(1) extra space</strong> </p> http://geeksforgeeks.org/forum/topic/permutations-of-a-string-without-repeatition#post-36385 Sun, 05 Feb 2012 17:09:47 +0000 agrawal25 36385@http://geeksforgeeks.org/forum/ <p># include &lt;iostream&gt;<br /> # include &lt;string&gt;</p> <p>using namespace std;</p> <p>int count=0;<br /> void permun(string s1, string s2){<br /> int n=s2.size();<br /> if(s2.size()==2){<br /> cout&lt;&lt;s1&lt;&lt;s2[0]&lt;&lt;s2[1]&lt;&lt;endl;<br /> cout&lt;&lt;s1&lt;&lt;s2[1]&lt;&lt;s2[0]&lt;&lt;endl;<br /> ::count+=2;<br /> }<br /> else{<br /> for(int i=0; i&lt;n; i++){<br /> int x;<br /> x=s2.find(s2[i]);<br /> string s, s3;<br /> s=s2;<br /> s3=s.erase(x, 1);<br /> permun(s1+s2[i], s3);<br /> }<br /> }<br /> }</p> <p>int main(){<br /> string str;<br /> cin&gt;&gt;str;<br /> sort(str.begin(), str.end());<br /> string fxd;<br /> fxd= "";</p> <p> permun(fxd, str);<br /> cout&lt;&lt;::count&lt;&lt;endl;<br /> system("pause");<br /> return 0;<br /> } </p> http://geeksforgeeks.org/forum/topic/microsoft-interview-question-for-software-engineerdeveloper-fresher-about-strings-8#post-36384 Sun, 05 Feb 2012 17:06:04 +0000 agrawal25 36384@http://geeksforgeeks.org/forum/ <p># include &lt;iostream&gt;<br /> # include &lt;string&gt;</p> <p>using namespace std;</p> <p>int main(){<br /> string s="1AF";<br /> int y=0;<br /> for(int i =0; i&lt;s.size(); i++){<br /> y*=16;<br /> if(s[i]&gt;='0' &amp;&amp; s[i]&lt;='9')<br /> y+=(int)s[i]-48;<br /> if(s[i]&gt;='A' &amp;&amp; s[i]&lt;='F')<br /> y+=(int)s[i]-55;<br /> if(s[i]&gt;='a' &amp;&amp; s[i]&lt;='f')<br /> y+=(int)s[i]-87;<br /> }<br /> cout&lt;&lt;y&lt;&lt;endl;</p> <p> system("pause");<br /> return 0;<br /> } </p> http://geeksforgeeks.org/forum/topic/amazon-online-written-test-dce#post-36383 Sun, 05 Feb 2012 08:53:57 +0000 mukuljain.dtu 36383@http://geeksforgeeks.org/forum/ <p>1. Write a function isValid(int sudoko[][]) to chec whether a given sudoko solution is valid or not.</p> <p>2. You are given a paragraph in which the length of all the words in a line has following properties:<br /> odd position words are in increasing order of their length<br /> even position words are in decreasing order of their length<br /> you are given a word, you have to write a code to search it in the given paragraph and return the line<br /> number. </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-0-2-years-about-trees-2#post-36382 Sun, 05 Feb 2012 02:21:23 +0000 PsychoCoder 36382@http://geeksforgeeks.org/forum/ <p><a href="http://www.geeksforgeeks.org/archives/10379" rel="nofollow">http://www.geeksforgeeks.org/archives/10379</a> </p> http://geeksforgeeks.org/forum/topic/google-interview-question-for-software-engineerdeveloper-fresher-about-algorithms-15#post-36381 Sun, 05 Feb 2012 02:17:13 +0000 dee 36381@http://geeksforgeeks.org/forum/ <p>This might help understand the time complexity better </p> <p><a href="http://stackoverflow.com/questions/2582732/time-complexity-of-sieve-of-eratosthenes-algorithm" rel="nofollow">http://stackoverflow.com/questions/2582732/time-complexity-of-sieve-of-eratosthenes-algorithm</a> </p> http://geeksforgeeks.org/forum/topic/binar-tree-to-double-linked-list-circular-conversion#post-36379 Sat, 04 Feb 2012 17:22:54 +0000 kasireddi 36379@http://geeksforgeeks.org/forum/ <pre>struct node { int data; struct node* left; struct node* right; }; typedef struct node* Node; //root: Current tree node //prev: this pointer should have the address of in-order predecessor of root //head: this denoted head of final link list void treeToDoublyList(Node root, Node &amp; prev, Node &amp; head) { if (!root) return; treeToDoublyList(root-&gt;left, prev, head); // current node's left points to previous node root-&gt;left = prev; if (prev) prev-&gt;right = root; // previous node's right points to current node else head = root; // if previous is NULL that current node is head Node right = root-&gt;right; //Saving right node //Now we need to make list created till now as circular head-&gt;left = root; root-&gt;right = head; //For right-subtree/parent, current node is in-order predecessor prev = root; treeToDoublyList(right, prev, head); } //Wrapper function Node treeToDoublyList(Node root) { Node prev = NULL; Node head = NULL; treeToDoublyList(root, prev, head); return head; }</pre> http://geeksforgeeks.org/forum/topic/mindtree-interview-question-for-software-engineerdeveloper-fresher-about-algorithms-1#post-36378 Sat, 04 Feb 2012 16:23:22 +0000 kartik_patil 36378@http://geeksforgeeks.org/forum/ <p>Given a log file that contains latency for each request of an API, how to calculate the median of the API latency? </p> http://geeksforgeeks.org/forum/topic/mindtree-interview-question-for-software-engineerdeveloper-fresher-about-algorithms#post-36377 Sat, 04 Feb 2012 16:21:43 +0000 kartik_patil 36377@http://geeksforgeeks.org/forum/ <p>Given a log file that contains latency for each request of an API, how to calculate the median of the API latency? </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-about-arrays-32#post-36376 Fri, 03 Feb 2012 20:51:49 +0000 PsychoCoder 36376@http://geeksforgeeks.org/forum/ <p><em><strong>Running Complexity O(n)</strong></em></p> <pre> #include&lt;stdio.h&gt; #include&lt;stdlib.h&gt; int* blabberedQuickSort (int *arr1, int *arr2, int len1, int len2) { int lindex1 = len1-1, lindex2 = len2-1 ; int actindex = (len1+len2-1); while ( lindex1&gt;=0 &amp;&amp; lindex2&gt;=0 ) { if (arr1[lindex1] &gt; arr2[lindex2]) { arr2[actindex--] = arr1[lindex1--]; } else { arr2[actindex--] = arr2[lindex2--]; } } while (lindex1&gt;=0) { arr2[actindex--] = arr1[lindex1--]; } /* We do not need to do the same for arr2 because they all are sorter already */ return arr2 ; } void printList (int *arr, int len) { int i ; printf ( "\n\n" ) ; for ( i = 0 ; i &lt; len ; i ++ ) printf ( "%d ", arr[i] ); printf ( "\n" ) ; } int main() { int len1, len2 ; int *arr1, *arr2 ; int i; printf ( "\nEnter the number of elements of array1 :\t" ) ; scanf ( "%d", &amp;len1 ); arr1 = (int *) malloc (sizeof(int) * len1); for ( i = 0 ; i &lt; len1 ; i ++ ) { printf ( "\nArray_1[%d] = ", i ) ; scanf ( "%d", &amp;arr1[i] ) ; } printf ( "\nEnter the number of elements of array2 :\t" ) ; scanf ( "%d", &amp;len2 ); arr2 = (int *) malloc (sizeof(int) * (len2+len1)); for ( i = 0 ; i &lt; len2 ; i ++ ) { printf ( "\nArray_2[%d] = ", i ) ; scanf ( "%d", &amp;arr2[i] ) ; } printList (arr1,len1) ; printList (arr2,len2) ; arr2 = blabberedQuickSort (arr1,arr2,len1,len2); printList (arr2,len1+len2) ; return 1 ; } </pre> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-testing-0-2-years#post-36375 Fri, 03 Feb 2012 19:04:18 +0000 PsychoCoder 36375@http://geeksforgeeks.org/forum/ <p>@padmaja_39 : You should handle the negative number caused by (arr[i]-num) </p> http://geeksforgeeks.org/forum/topic/amazon-interview-question-for-software-engineerdeveloper-about-algorithms-94#post-36374 Fri, 03 Feb 2012 19:01:13 +0000 kartik 36374@http://geeksforgeeks.org/forum/ <p>\Round5 | Q2 : Suppose, Amazon have a Logging system Like This:</p> <p>They Track all logs daily basis, stored in separate log file.Log contains a collection of tuples of Customer ID and Page ID. The length of Customer ID and Page ID is L1 and L2. Suppose We have a log of D-days , and size of each log fine can be Order of n , where n be the number of customer.<br /> In a most generalized situation, you can assume that a customer can visit the same page multiple times in a day or any number of days.</p> <p>We are interested to find out the number of Distinct customer visited at-least p distinct pages within exactly T days.</p> <p>Propose a Data Structure to be use to solve this problem efficiently . Design an Algorithm to solve this problem and Find out the complexity of the algorithm.</p> <p>{Hints:- Double Hashing/ {Hashing +Tries/BST }}</p> <p>By Sourabh (<a href="http://www.geeksforgeeks.org/archives/17629/comment-page-1#comment-7362" rel="nofollow">http://www.geeksforgeeks.org/archives/17629/comment-page-1#comment-7362</a>) </p> http://geeksforgeeks.org/forum/topic/printing-all-repeated-combination-of-given-lengthof-a-string#post-36373 Fri, 03 Feb 2012 15:54:07 +0000 kartik 36373@http://geeksforgeeks.org/forum/ <p>@PsychoCoder: Awesome code!.<br /> Few small points<br /> 1) The allocated memory for data should be (len +1) characters. One extra space is needed for string terminator (\O)<br /> 2) data[len] should be set as string terminator character before calling allLexicographicCombo ()<br /> 3) String should be sorted before calling allLexicographicCombo(), as the output strings are expected to be in sorted order.</p> <p>We can probably write a wrapper function that allocates memory for data, does above 3 things, and calls allLexicographicCombo (). </p>