Adobe Interview Questions
- 0of 0 votes
AnswersGiven a Matrix of M by N, each cell containing 0 or 1. Find the max contiguous trail of 1's. (trail could be horizontal, vertical or diagonal)
- torchbearer October 08, 2012 in United States| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - -1of 1 vote
AnswersWe have a long chain of cuboids in all the six directions (six faces). One start node is given and one end node is given. Give a data structure to represent this also search for the given node from start node.
- Nitin Gupta October 08, 2012 in India for Live Cycle| Report Duplicate | Flag | PURGE
Adobe Member Technical Staff Algorithm Data Structures - 0of 0 votes
AnswersFind the sub array from an array of positive numbers where sum is maximum and numbers that are selected are not adjacent
- DashDash October 07, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - -1of 1 vote
AnswersGiven a number, find next higher palindrome number that comes after this number. Give algorithm.
- Nitin Gupta October 07, 2012 in United States for Live Cycle| Report Duplicate | Flag | PURGE
Adobe Member Technical Staff Algorithm - -1of 1 vote
AnswersPrint a rectangle on screen only if it doen't intersect with other rectangles which are already drawn on screen.Minimise number of comparisons
- nk October 06, 2012 in United States for InDesign
Note :- the rectangles are axis-aligned| Report Duplicate | Flag | PURGE
Adobe Member Technical Staff Algorithm - -1of 1 vote
AnswersWrite a code to generate Pascals triangle of any level.
- Nitin Gupta October 05, 2012 in India| Report Duplicate | Flag | PURGE
Adobe MTS Algorithm Data Structures - 0of 2 votes
AnswersI have a list of N teams T1, T2, T3 … Tn. Each of these teams has played a match against every other team. I have a function displayResult(Team T1, Team T2), it returns the team which won the match between any two given teams T1 and T2.
- Nitin Gupta October 05, 2012 in India
I have to write the teams in an order such the (n-1)th team (in the order) had lost to the nth team which in turn had lost to (n+1)th team..Write Code| Report Duplicate | Flag | PURGE
Adobe MTS SDE1 Algorithm Data Structures - -1of 1 vote
AnswersFind the mean and median of the elements which are dynamically added at runtime.
- Nitin Gupta October 05, 2012 in India| Report Duplicate | Flag | PURGE
Adobe MTS Algorithm Data Structures - -2of 2 votes
AnswersGiven a sorted but rotated array. Search an element inside it without finding the pivot. Complexity of the solution should still remain O(Log n)
- Nitin Gupta October 05, 2012 in India| Report Duplicate | Flag | PURGE
Adobe MTS Algorithm Arrays Data Structures - -1of 1 vote
AnswersGiven a sorted but rotated array. Find the pivot.
- Nitin Gupta October 05, 2012 in India| Report Duplicate | Flag | PURGE
Adobe MTS Algorithm Arrays Data Structures - -1of 1 vote
AnswersHow will you implement a stack using a priority queue. Push and pop should be in O(1).
- Nitin Gupta October 05, 2012 in India| Report Duplicate | Flag | PURGE
Adobe MTS Algorithm Data Structures - -1of 3 votes
AnswersWhat data structures will you use to implement a text editor. Size of editor can be changed and you also need to save the styling information for all the text like italic, bold etc.
- Nitin Gupta October 05, 2012 in India| Report Duplicate | Flag | PURGE
Adobe MTS Algorithm Data Structures - 0of 0 votes
AnswersWrite an algorithm that takes a file containing a sequence of lines representing all the folders in a mailbox where each line is of the form Id,ParentId,Name and produces a sorted hierarchy of folders with children indented from their parents and each line containing DisplayName:Id. For example if the input is:
- barathrum September 24, 2012 in United States
4,17,Scott
1,0,Spock
17,0,McCoy
9,17,Kirk
Then the output should be:
McCoy:17
Kirk:9
Scott:4
Spock:1| Report Duplicate | Flag | PURGE
Adobe Developer Program Engineer Algorithm - 0of 0 votes
AnswersGiven a matrix with letters in each square and you have to find words which are there in the dictionary (like Children's Crosswords). You have been given a function which outputs 1 if the given word is in the dictionary. The word could be bidirectionally horizontal, vertical or diagonal. Write an optimal algorithm for printing all such words.
- nk September 19, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersThere are two sets A and B with n integers, write a program to check the whether there exists two numbers a in A and b in B such that > a+b = val ( val is given );
- Anonymous September 19, 2012 in India| Report Duplicate | Flag | PURGE
Adobe - 0of 0 votes
Answers#include<stdio.h> #include<stdlib.h> int main(){ union A { long int y[5]; union B{ double g; union C{ int k; union D{ char ch; int x[5]; } s; }a; }b; }*p; p=(union A * ) malloc ( sizeof (union A)); p->b.a.k=15; printf("%d %d \n",p->b.a.s.x[0],p->y[0]); }
output : 15 15
- Anonymous September 19, 2012 in United States
plz explain with working| Report Duplicate | Flag | PURGE
Adobe - 0of 0 votes
Answers//what will be the output of the program if characters 'hello world' and enter are supplied to the program ?
#include<stdio.h> int main() { void fun(); fun(); printf("\n"); return 0; } void fun() { char c; if((c=getchar())!= '\n') fun(); printf("%c ", c); }
output : d l r o w o l l e h
- Anonymous September 19, 2012 in United States
(plz Explain...)| Report Duplicate | Flag | PURGE
Adobe - 0of 0 votes
AnswersGiven an array of integers. Re arrange the numbers such that odd numbers occupy odd position and even numbers occupy even position. The order of numbers should not change and it is to be done in-place.
- Nascent September 16, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersGiven a file with a list of words, find 10 most frequently occuring words. Give most optimized solution.
- Nascent September 16, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersGiven a Binary tree (not the BST) , Produce the Ancestor matrix
- arul September 02, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
Answersoutput and why ?
- pramod August 26, 2012 in India for c++#include<iostream> class con { struct node { int data; int rest; }; public: con() {} }; int main() { con c; std::cout<<"size of con class ="<<sizeof(c); return 0; }
| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer C++ - 0of 0 votes
AnswersGiven a binary tree, you have to convert it into a doubly linked list (inplace i.e you cannot use extra memory)
- ashok.singh.sairam August 26, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersYou are given a binary tree ( a general binary tree ) and not binary search tree, you have to find the node which is the lowest common ancestor of both these nodes. Can we perform better if it is a binary search tree?
- ashok.singh.sairam August 26, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersGiven two char arrays X="ZTANBMBLAUCY " and Y ="GABVCBKLAMNC", write an algorithm to find the longest subsequence that is present in both of them.
- ashok.singh.sairam August 24, 2012 in India
In the above case the common subsequence is "ABBAC".
Also describe the time complexity of your algorithm.| Report Duplicate | Flag | PURGE
Adobe Computer Scientist Dynamic Programming - 0of 0 votes
AnswersN*N matrix. contains only 0's and 1's.
- kb August 13, 2012 in India
every row is sorted in descending order.
find row containing maximum no of 1's. Efficient soln reqd.| Report Duplicate | Flag | PURGE
Adobe Amazon Algorithm Coding - 0of 0 votes
AnswersYou have a database table Emp with data as follows:
- kavitha July 31, 2012 in United States
EmpId FirstName LastName
1 Bob Lync
2 Sarah John
3 Bob Lync
4 John Doe
5 Stanly Jeff
6 Sarah John
With a single sql query, how will you cleanup the database (eliminate redundant data from above table)| Report Duplicate | Flag | PURGE
Adobe Software Engineer in Test Database - 0of 0 votes
AnswersWhich data structure will you use for creating a real world dictionary?
- kavitha July 31, 2012 in United States| Report Duplicate | Flag | PURGE
Adobe Software Engineer in Test Data Structures Java