Some of the questions from written paper today at Adobe:
1. Write a single_pass_sort(array arr, array_len l) routine to sort the elements of arr in ascending order in one pass. you are given that elements are only 0 or 1.
2. WAP to generate all permutation of string s.
3. WAP to Flip all the bits at odd index of an unsigned int.
4. Write a function to search the presence of a string t in s such that the result shows the index of right most occurence of t in s. else return a -1.
5. Given inorder and preorder, form the tree.
6. Automata based some fodu question.
7. Given a singly linked list. Without using any temporary datastructure from ur side and starting with the given head pointer print the data of the nodes in reverse order.
8. find missing number in an array of size [n-1] containing numbers from 1 to n.
BUT besides all this APTITUDE ki fodu practice needed!! 