GeeksforGeeks

A computer science portal for geeks

GeeksQuiz
Login Home Algorithms DS GATE Interview Corner Q&A C C++ Java Books Contribute Ask a Q About Array Bit Magic C/C++ Articles GFacts Linked List MCQ Misc Output String Tree Graph

Adobe Interview | Set 2

I have recently been through the recruitment process of ADOBE. I didnt get through (I got the reply today), but I sincerely hope that my experience will help some of you in your endeavors. Round 0: Written Test - I was called for a written test. The test was 3 hours long. It had four sections Quantitative, Analytic, Data Structures and Algorithms, and Core Java & J2EE fundamentals

The questions were simple. The paper had a time limit for each of the individual sections but somehow the HR collected the answer sheets (and the question papers) all together at the end of 3 hours. There was no negative marking but they had a different weight-age for questions in each section Quantitative: 30 multiple choice questions. Time limit: 45 minutes Analytical: 3-4 Analytical Puzzles followed by 4-5 follow up questions (multiple choice). Time limit: 15 minutes Data Structures & Algorithm: 10 questions (not multiple choice) to be answered with a brief explanation. Questions like 24ABC in base 6 would be what in a base 7 system. Write a program to find the missing number in an array of size N-1 which had jumbled up numbers ranging from 1 to N. I hope you get the idea. Core JAVA & J2EE The Core JAVA section had general questions on JAVA. They stressed a lot on threads. I dint know much about J2EE but the whole paper had just 6 questions on it, so missing them didnt cost me much. Almost a week later the HR informed me that I had done really well in the test and that I have to come to the ADOBE office for the first set of interviews. Interview 1 1) He gave me a custom PERSON object. This object had some properties like name, surname, age etc. He asked me to write a function which can return the size of this object. He asked me to write a generic code that will work with any object. The object may have inbuilt data types like in the PERSON object or it may have another custom object inside it such as a FAMILYBACKGROUND object. He gave me a few functions from the JAVA API which can tell you about the contents of an object. He asked me to write a helper function that can return the size of default data types like int, float etc. 2) He gave me a sorted but rotated array and asked me to find the pivot. Interview 2 1) He gave me a sorted but rotated array and asked me to search an element inside it without finding the pivot. Complexity of the solution should still remain O(Log n) 2) Find the mean and median of the elements which are dynamically added at runtime. 3) I 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. 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.. For example if in a particular order, the teams appeared as T1, T2, T3, T4 then team T1 had lost to T2, T2 had lost to T3, and T3 had lost to T4 It may be possible that T3 lost to T1 .. but that need not be taken into consideration while writing the order. Only the neighboring elements should be such that the element on the left has lost to the element on the right. How will you write the teams in this order? Write a code for it Make all the necessary assumptions you need to solve the problem.

4) Print an order of all the knight moves such that it fills up an 8 by 8 chess board. The moves should be such that no block that has been stepped on is visited again. After a few days, the HR informs me that I have qualified for the next round. Only this time my interview will be taken by some of the senior executives at ADOBE. Interview 3 1) General discussion about the work done in projects, internships etc. 2) What is reflection? How does JVM find the right class to instantiate an object? 3) Draw a Pascal triangle. Write a code to print the elements of an N level Pascal triangle using a 1 dimensional array. Interview 4 1) Generate all possible combinations (of r elements) inside an array of size N E.g. arr [] = {2,8,14} All possible combinations of r=2 will be {2,8}, {8,14}, {14,2} 2) Why are string objects immutable in java? How are Strings structurally designed in java? 3) When should one use merge sort and when should one use quick sort? HR General questions like if selected which office would I like to work for? Where do I see myself 5 years from now? etc etc I stumbled on the interview questions in the fourth round (Probably why I wasnt selected). Please post if someone has answers to them. Best of luck. Source: http://www.geeksforgeeks.org/forum/topic/adobe-interview-8th-september-28th-september-2012 Thanks to ganglu for sharing interview experience. If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Related Tpoics:
Amazon Interview | Set 63 (For SDE-1) Amazon Interview | Set 62 (For SDE-1) Amazon Interview | Set 61 (For Internship) Amazon Interview | Set 60 (For Internship) Flipkart Interview | Set 3 Amazon Interview | Set 59 (Off-campus for SDE-1) Amazon Interview | Set 58 (On-campus for Software Development Engineer) Amazon Interview | Set 57 (Off-Campus for SDE-1)
Like 0 Tw eet 0 0

Writing code in comment? Please use ideone.com and share the link here.
15 Comments
Sort by Newest

GeeksforGeeks
Share

Login
Favorite

Join the discussion

adobeNoidaHiringManagerSucks

4 months ago

Adobe Noida is the worst place. I gave my tech interview for White Box Testing and here is my experience. All recruiters and hiring managers are the biggest assholes. They ask qns in interviews from internet and stick to answer written there w/o knowing the validity. They don't listen to candidate's explanation. The hiring manager was all time asshole who was mocking and did not respect the work I do. He starting saying "why don't you use that.. you are reinventing the wheel.." I explained him the reason of flexibility. He said no no.. you are wrong. He started bragging that "I used this and that in my college days.. you are way behind!". Even though the hiring manager was previously from non-IIT college and services based companies then why is he bragging and mocking on other who are trying hard sincerely to work for Adobe

then why is he bragging and mocking on other who are trying hard sincerely to work for Adobe systems. In my opine Adobe's image is degrading because of such suckers and assholes in the Noida office. Now coming to recruiters, they don't even have engineering degree but still attitude of tons. Those bullshit people don't respond to your calls, emails and keep giving stupid reasons.Recruiters are collecting brand name tags of IIT in noida office. they are not respecting talent. This is to inform John Warnock and Charles Geschke that there are such asshole recruiters and hiring managers that are corrupting your equal opportunity rule.
Reply Share

Anshum

10 months ago

He gave me a sorted but rotated array and asked me to search an element inside it without finding the pivot. Complexity of the solution should still remain O(Log n) Comments requested
# i n c l u d e < s t d l i b . h > # i n c l u d e < s t d i o . h >

i n ta r r [ ] = { 9 , 1 0 , 1 1 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 } ; i n ts i z e a r r = s i z e o f ( a r r ) / s i z e o f ( i n t ) ; i n tf i n d E l e m e n t ( i n ts t a r t , i n te n d , i n te l e m e n t ) { i f ( e n d < s t a r t ) r e t u r n1 ; i n tm i d = ( ( e n d s t a r t ) / 2 ) + s t a r t ; i f ( a r r [ m i d ] = = e l e m e n t ) r e t u r nm i d ; i f ( m i d < ( s i z e a r r 1 ) & & a r r [ m i d ] > a r r [ m i d + 1 ] ) { see more

Reply Share

Sunny

a year ago

How to implement? Generate all possible combinations (of r elements) inside an array of size N E.g. arr [] = {2,8,14} All possible combinations of r=2 will be {2,8}, {8,14}, {14,2}
/ *P a s t ey o u rc o d eh e r e( Y o um a yd e l e t et h e s el i n e si fn o tw r i t i n gc o d e )* /

Reply Share

ganglu

a year ago

/ *P a s t ey o u rc o d eh e r e( Y o um a yd e l e t et h e s el i n e si fn o tw r i t i n gc o d e )* /

Reply Share

ganglu

ganglu a year ago

Answers to the questions in the comments .. @neelverma Is it 24ABC in base 6 or in base 16? It is in base 16 .. sorry .. my bad .. @Priyansh suppose there is a sorted array 123456 which is rotated like 654123 , then what is the pivot?? If you rotate the array it would look like 456123 and not like the way you have posted.. the pivot in this case is the position from where the rotated part is glued to the original array .. here it would be position 2 .. arr[2] = 6 you can refer to this post for the solution http://www.geeksforgeeks.org/a... @Girish Does it matter for interview pattern? I think NO ..
see more
Reply Share

neelverma

ganglu a year ago

One more query what is the use of 1-D array in printing pascal triangle.Pascal Triangle can be printed out with the help of for loops. Can u please Explain me how can we use array ?
/ *P a s t ey o u rc o d eh e r e( Y o um a yd e l e t et h e s el i n e si fn o tw r i t i n gc o d e )

Reply Share

ganglu

neelverma a year ago

if you can print something, you can also store it in an array .. anyways .. how are you planning to do it with FOR loops ? Why did i need 1 D array ?

Why did i need 1 D array ? I was using the approach that in any row an element is the sum of upper two neighbouring elements .. 11 121 here 2 is them sum of (1+1) I was using this approach to build the triangle .. so i needed it .. do let me know what you think ...
Reply Share

Priyansh

ganglu a year ago

By mistake I posted that...... Thanks anyways :)

/ *P a s t ey o u rc o d eh e r e( Y o um a yd e l e t et h e s el i n e si fn o tw r i t i n gc o d e )

Reply Share

neelverma

a year ago

Is it 24ABC in base 6 or in base 16?

/ *P a s t ey o u rc o d eh e r e( Y o um a yd e l e t et h e s el i n e si fn o tw r i t i n gc o d e )* /

Reply Share

Priyansh

a year ago

In the question "He gave me a sorted but rotated array and asked me to find the pivot." What does the pivot exactly means. suppose there is a sorted array 123456 which is rotated like 654123 , then what is the pivot??
/ *P a s t ey o u rc o d eh e r e( Y o um a yd e l e t et h e s el i n e si fn o tw r i t i n gc o d e )* /

Reply Share

Kartik

Priyansh a year ago

Reply Share

See http://www.geeksforgeeks.org/a...

man

a year ago

This was @ Adobe noida or bangalore?

/ *P a s t ey o u rc o d eh e r e( Y o um a yd e l e t et h e s el i n e si fn o tw r i t i n gc o d e )* /

Reply Share

Girish

man a year ago

Reply Share

Does it matter for interview pattern?

soumya

a year ago

can u please give the answer for the question "When should one use merge sort and when should one use quick sort?"
1
Reply Share

Kartik

soumya a year ago

Quick sort performs better on average. Merge sort is preferred for external sorting when the complete array cannot be place in memory. Quick sort cannot be used for Linked Lists. Merge sort can be used to sort a linked list in O(nLogn) time. Following are some lines from Wiki page of Merge Sort. On typical modern architectures, efficient quicksort implementations generally outperform mergesort for sorting RAM-based arrays. On the other hand, merge sort is a stable sort, parallelizes better, and is more efficient at handling slow-to-access sequential media. Merge sort is often the best choice for sorting a linked list:
Reply Share

Subscribe

Add Disqus to your site

GeeksforGeeks
Like

46,021 people like GeeksforGeeks.

Facebook social plugin

Interview Experiences Advanced Data Structures Dynamic Programming Greedy Algorithms Backtracking Pattern Searching Divide & Conquer Graph Mathematical Algorithms Recursion

Popular Posts

All permutations of a given string Memory Layout of C Programs Understanding extern keyword in C Median of two sorted arrays Tree traversal without recursion and without stack! Structure Member Alignment, Padding and Data Packing Intersection point of two Linked Lists Lowest Common Ancestor in a BST. Check if a binary tree is BST or not Sorted Linked List to Balanced BST

654

Subscribe

Recent Comments

ATul Yup its only the left shift ie only... Interesting Facts about Bitwise Operators in C 3 minutes ago Rahul If we modify the node structure a little bit,... Find distance between two given keys of a Binary Tree 14 minutes ago Guest If we modify the node structure a little bit,... Find distance between two given keys of a Binary Tree 19 minutes ago abhamish mishra @geeksforgeeks:disqus .. will the solution work... Find if two rectangles overlap 30 minutes ago niraj its a left shift will increase the value of N... Interesting Facts about Bitwise Operators in C 35 minutes ago hrithikg http://www.slideshare.net/gyan...... Local Classes in C++ 1 hour ago

How to Interview Interview Array

Adobe Print Elements Adobe Java To

Java To Java Test Tool Java Job Opening

@geeksforgeeks, Some rights reserved Contact Us! Powered by WordPress & MooTools, customized by geeksforgeeks team