Adobe Interview Questions
- 0of 0 votes
Answersprint all paths from root to leaves( written test)
- truekool2 June 15, 2011| Report Duplicate | Flag | PURGE
Adobe Computer Scientist Algorithm - 0of 0 votes
Answerswrite a program to find height of a bst.( written test)
- truekool2 June 15, 2011| Report Duplicate | Flag | PURGE
Adobe Computer Scientist Algorithm - 0of 0 votes
AnswersYou can concatenate A to A, and search B in the resulted string using an O(n) algorithm, KMP, Boyer Moore.
- wfchiang May 23, 2011| Report Duplicate | Flag | PURGE
Adobe Testing / Quality Assurance - 0of 0 votes
AnswersGiven an array A[i..j] find out maximum j-i such that A[i]<a[j] in
- Rama May 19, 2011
O(n) time.| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersImagine there are infinite number of Queens (Chess Game Piece) with u. Find the minimum number of queens required so that every square grid on the chess board is under the attack of a queen. Arrange this minimum no. of Queens on a chess board.
- ilovealgo May 13, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Brain Teasers - 0of 0 votes
AnswersWhen Adobe is going to conduct a test in Hyderabad .....
- HardyBoy May 10, 2011| Report Duplicate | Flag | PURGE
Adobe - 0of 0 votes
AnswersYou are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to set all bits between i and j in N equal to M (e.g., M becomes a substring of N located at i and starting at j).
- Algoseekar April 29, 2011
EXAMPLE:
Input: N = 10000000000, M = 10101, i = 2, j = 6
Output: N = 10001010100
_
________________________________________________________________| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Bit Manipulation - 0of 0 votes
AnswersWrite a function
- xcx April 24, 2011
int triangle(const vector<int> &A);
that given a zero-indexed array A consisting of N integers returns 1 if there exists a triple (P, Q, R) such that $0 \leq P < Q < R < N$ and
A[P] + A[Q] > A[R],
A[Q] + A[R] > A[P],
A[R] + A[P] > A[Q].
The function should return 0 if such triple does not exist. Assume that $0 \leq N \leq 100,000$. Assume that each element of the array is an integer in range [-1,000,000..1,000,000].
For example, given array A such that
A[0]=10, A[1]=2, A[2]=5, A[3]=1, A[4]=8, A[5]=20
the function should return 1, because the triple (0, 2, 4) fulfills all of the required conditions.
For array A such that
A[0]=10, A[1]=50, A[2]=5, A[3]=1
the function should return 0| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersWhat's the complexity of the following code?
- Anonymous April 21, 2011
int fib(int n){
if(n==0||n==1){
return 1;
}
return fib(n-1)+fib(n-2);
}| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersFormatting was incorrect so posted again.
Consider the given structure:
struct node
{
int data;
struct node *next;
struct node *next_larger;
}
You are given a list where each node is of type defined above. Initially all the next larger pointer of each node points to NULL. Write an algorithm to update the next larger pointer of each so that they point to immediate next largest node in the list.
e.g.
- Riya April 17, 20114-------->8------->2------->1------->9 |->NULL |->NULL |->NULL |->NULL |->NULL Output: |------------------| V |--------!-----------------V 4-------->8------->2------->1------->9 |---------^ ^--------| |--->NULL
| Report Duplicate | Flag | PURGE
Adobe Developer Program Engineer - 0of 0 votes
AnswersWrite an algorithm that finds the contiguous subsequence of elements in an array with largest sum. The elements in the array can be negative.
- Ajai March 27, 2011
Is there a O(n) solution for it? Any good solutions are very much appreciated.| Report Duplicate | Flag | PURGE
Adobe Developer Program Engineer Algorithm - 0of 0 votes
AnswersA frog has to cross a river. There are n rocks in the river, using which the frog can leap across the river. On its way across the river the frog can chose to skip a rock, but it cannot skip two consecutive rocks because that would be two far a distance for the frog to hop, also the from would not skip the first rock and the last rock. E.g. if there are 3 rocks, 1,2,3 and 4, there could be three following routes it could take:
- CuriousMe March 19, 2011
1,2,3,4
1,2,3,4
1,3,4
1,2,4
Write a recursive algorithm, that takes a number of rocks' and prints all the feasible paths. Ofcourse there can be other arguments too.| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersThere is a circle enclosed in a square,such that it is touching all the four sides of the square. In the top left space between square and the circle, there is a rectangle with length 14 and breadth 7, such that top left corner of the rect is the top-left corner of square and bottom right corner lies on the circumference of the circle. What is the radius of the circle?
- CuriousMe March 19, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Brain Teasers - 0of 0 votes
AnswersThere is a 2X4 matrix, in this you are supposed to arrange the numbers from 1-8, so that no consecutive numbers are adjacent(vertically, horizontally and diagonally) to each other. It is possible to do if one keeps on trying it randomly but it can be done with an intelligent approach too. What would that be?
- CuriousMe March 19, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Brain Teasers - 0of 0 votes
AnswersCount No of Set bits in Number in O(1)..yes its possible interview told me
- Algo_boy March 16, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
Answersyou have a sequence where each number is a multiple of 2 or 5 (so: 2^i * 5^j). Given the beginning of the sequence as 1,2,4,5,8,10,16... and find a algorithm to calculate the next number in the sequence?
- Algoseekar March 09, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersGiven a binary tree of depth d, print all the paths from root to leaf.
- CupOfLife March 08, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersWrite a Program to remove loop from linked list..program should be clean & should pass all test cases..he wants from me exact working code
- Algoseekar March 07, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersDescribe in brief the data structure you will use to implement the game of snake(mobile game).
- thear February 28, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersDescribe in brief the data structure you will use to implement the game of minesweeper.
- thear February 28, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersDescribe in brief the data structure you will use to implement the game of snakes and ladders.
- thear February 28, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersYou are given a function. When it is called, it returns 0 with 60% probability, and 1 with 40% probability. Now using this function, write a new function that returns 0 with 50% probability and 1 with 50% probability.
- thear February 28, 2011| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Coding - 0of 0 votes
AnswersAn array of integers contains negative numbers and positive numbers, then arrange the array in that way sothat -ve number and +ve number in alternative place. remaining extra -ve number or +ve number put at last.
- ajit February 27, 2011
e.g.
-1 -2 4 5 6 -3 9 -8 7
output: -1 4 -2 5 -3 6 -8 9 7| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersI was asked basic loop detection in a linked list problem. I answered it. But the follow up question made me stuttered.
- Az February 24, 2011
" How do you find the beginning or starting point of the loop in the linked list ". Anyone have any idea?| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersDesign a Thread safe Array Based queue with a fixed size.
- kapilraju February 19, 2011
The behavior should be in such a way that if multiple threads are accessing the same queue and if the queue is full the threads will wait for their turn and if some other threads removes elements from queue, the waiting threads will get a chance to add elements.| Report Duplicate | Flag | PURGE
Adobe Developer Program Engineer Coding