Adobe Interview Questions
- 0of 0 votes
AnswersWrite a Program such that
- Razz May 05, 2013 in India
1. Thread T1 and T2 are doing job J1 and J2 respectively.
2. Job J2 can't be start by J2 untill job J1 is done by J1.
3. Write code without using Join() method.| Report Duplicate | Flag | PURGE
Adobe Member Technical Staff Java - 0of 0 votes
AnswersDesign a DS for storing browsing history.
- Nascent April 20, 2013 in United States| Report Duplicate | Flag | PURGE
Amazon Adobe Software Engineer / Developer - 4of 4 votes
Answerswrite a java program to reverse a string.
- Anil April 17, 2013 in United States| Report Duplicate | Flag | PURGE
Adobe Quality Assurance Engineer - 0of 0 votes
AnswersWrite a java program to read a file and get different words and also print number of occurences of each word.
- Anil April 17, 2013 in United States| Report Duplicate | Flag | PURGE
Adobe Quality Assurance Engineer Java - 1of 1 vote
AnswersHow to find out if a linked list is circular?
- 2Careers1Cup March 22, 2013 in United States
(Apart from the straightforward way of going through all nodes and comparing with Head)| Report Duplicate | Flag | PURGE
Adobe - 0of 0 votes
AnswersGiven a number, return the next multiple of 64 that follows it, using bit operations and no loops.
- 2Careers1Cup March 22, 2013 in United States
e.g input = 90, return 128.| Report Duplicate | Flag | PURGE
Adobe - 1of 1 vote
AnswersHow to find out the minimum element in a stack(of integers)?
- 2Careers1Cup March 22, 2013 in India
You can modify the pop/push operations.| Report Duplicate | Flag | PURGE
Adobe - 0of 0 votes
AnswersHow can I find if a String exists in a double dimension Array. For eg. Does CAT exist in
- Abhi March 04, 2013 in United States
'c','b','k'
'd','a','l'
'g','t','i'
It does exist. What will be an optimal way to do it ?
Assume you don't have to move upwards in the Array.
So in the below Array cat does not exist.
'c','b','t'
'd','a','l'
'g','J','i'| Report Duplicate | Flag | PURGE
Adobe Computer Scientist Algorithm - 0of 0 votes
AnswersFind the occurences of each word in a sentence/
- Abhi February 16, 2013 in India
e.g :
"Hi I am there, am good"
am=2, good=1,Hi=1, I=1,there=1
Print in sorted order as per count.
If count is same, it should be alphabetically sorted.| Report Duplicate | Flag | PURGE
Adobe Android test engineer Algorithm - 0of 0 votes
AnswersGiven a ternary string, you have to count the total number of contiguous substrings (contigious set of characters), that you can form from this given string such that they comprise of either only one or two different characters.
- kumar.prince6 February 15, 2013 in India
Please note that a unique substring will be decided by its starting and ending indices. So, a substring 'ab' with starting and ending indices being 1 and 2 respectively should be considered different from a substring 'ab' with starting or ending indices (or both) other than 1 and 2 respectively.
For example:
input ternary string - aabc
output - 8
The above string comprises of the following substrings that have either one or two of the characters - a, a, b, c, aa, ab, bc and aab. So the final answer is a total of eight substrings.
input ternary string - abc
output - 5
The above string comprises of the following substrings that have either one or two of the characters - a, b, c, ab and bc. So the final answer is a total of five substrings.
input ternary string - baaccb
output - 16
The above string comprises of the following substrings that have either one or two of the characters - b, a, a, c, c, b, aa, cc, ba, ac, cb, baa, aac, acc, ccb and aacc. So the final answer is a total of sixteen substrings| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm - 0of 0 votes
AnswersIs any specific use of empty class??
- techieDeep January 29, 2013 in India| Report Duplicate | Flag | PURGE
Adobe Applications Developer - 0of 0 votes
AnswersHow the JVM is implemented to handles try catch finally .
- techieDeep January 28, 2013 in United States
Elaborate by taking any JVM.| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersWhat are the run time exceptions in java related to class and object creation??
class A{ ... dosomething(); .. } class B extends A{ ... dosomething(); donothing(); ... } class C expends A{ } A a =new B(); a.donothing(); //which type of error B b=new A(); A a1=new C(); B b=(b)a1;
Pls give input for anyother cases you may think better.
- techieDeep January 28, 2013 in United States| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersFor a given set of points find a point along with 3 others that are closest to each other.
- Nascent December 26, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
Answersfind 10 most frequently occurring words in a given file.
- Nascent December 26, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersWAP to compare string without library function in c??
- patilsanketv December 21, 2012 in United States
1)Program should be designed using Pointers
2)Most efficient i.e lesser number of loops or comparisons??| Report Duplicate | Flag | PURGE
Adobe Developer Program Engineer C - 0of 0 votes
AnswersWrite an efficient code in c to implement the words in dictionary order.
- SanBits December 12, 2012 in United States| Report Duplicate | Flag | PURGE
Adobe - 0of 0 votes
AnswersYou do have two linked list L1 and L2. The size of linked lists is huge and in billions. Linked List contains numbers (both negative and positive). For simplicity you can assume they are all integers.
- Geek December 09, 2012 in United States
You have been given a number say N. now you need to find out all of the pairs where one element from L1 + one element from L2 = N.
i.e.
L1 = 28, -7, 0, 56, 6, -8, 0, 72, 1000, -33
L2 = 53, 20, 27, -52, 99, 14, -8
N = 20
The answer will be:
(28, 8), (-7, 27), (0, 20), (6, 14), (0, 20), (72, -52)
more questions at http://dsalgointerview.wordpress.com/| Report Duplicate | Flag | PURGE
Adobe Computer Scientist Algorithm - 0of 0 votes
AnswersWrite a method to which will download a file from remote server
- Andi November 23, 2012 in India
conditions are: if remote server not responding then should go into resume. Once it up it should start download file from where it got resumed.| Report Duplicate | Flag | PURGE
Adobe Computer Scientist - 0of 0 votes
Answerswrite two separate methods,
- Andi November 23, 2012 in United States
1. read method to read file and
2. write method to write to file,,,
both must be thread safe and throughput (efficiency) should be high.| Report Duplicate | Flag | PURGE
Adobe Computer Scientist Application / UI Design - 0of 0 votes
AnswersGiven a variable, how can you find whether it was allocated from stack or from heap memory???
- himanshu November 17, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Member Technical Staff C C++ - 1of 1 vote
AnswersPrint a Random word from a file. Input is "path to a file",
- Shobhit November 15, 2012 in United States
constraints- No extra memory like hashing etc. All the words in the file should have equal probability.| Report Duplicate | Flag | PURGE
Adobe Software Analyst Algorithm - -1of 3 votes
AnswersGiven a number x = 0x25. Convert it into y = 0x25252525.
- Nitin Gupta November 03, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Member Technical Staff Algorithm Bit Manipulation C Coding - 0of 0 votes
Answers* 54. An array of integers of size n. Generate a random permutation of the array, given a function
- mittal.mayank0 November 03, 2012 in India
rand_n() that returns an integer between 1 and n, both inclusive, with equal probability. What is the
expected time of your algorithm?| Report Duplicate | Flag | PURGE
Adobe Accountant Algorithm - 0of 0 votes
AnswersGiven a 2D Boolean matrix consisting of 0s and 1s. Find the largest size rectangle having all four borders as 1. The interior of it may or may not be entirely filled with 1s.
- Nascent November 02, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - 0of 0 votes
AnswersHow to implement stack using queue
- nishant October 31, 2012 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Data Structures - 0of 0 votes
AnswersState the difference between this two statement.
- Psycho October 23, 2012 in India
char str[] = "/root//foo/bar" ;
char *str = "/root//foo/bar" ;
Now, you have given an assignment str[in1] = str[in2]
where in1 and in2 both initialize with 0.
In first type of declaration no problem. But in second type of declaration 'Segmentation fault' is there. Why this happens?| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer C - 0of 0 votes
AnswersGive a Data structure to store Name-value pair like name-age
- shani October 19, 2012 in India
"abc",12
"xyz",34...
such than insert(name,value), value = search(name), name = nthentry(n), delete(name); all can be perfomed in O(1).
Note:- after deletion order should be maintained.Ex.
"ds",12
"df",78
"teu",54
"etr",12
If delete("df") is called then nthentry(2) should return "teu"| Report Duplicate | Flag | PURGE
Adobe MTS Algorithm - 0of 0 votes
AnswersThere is one linked list having two pointer one as usual next and other is random pointer pointing to any random node in list.
- shani October 19, 2012 in India
write algo to make a duplicate of it.
Note:- Original list is const, Can't be modified.| Report Duplicate | Flag | PURGE
Adobe MTS Algorithm