Round 1:(Online Coding round)
There were 3 coding questions in 1 hour and 30 minutes. Question level was easy and easy -medium.
- Given a bag of capacity 1 kg to 3 kg. The bag can contain a maximum of two items at a time and total weight of items in the bag should be between 1 kg to 3 kg (because of the capacity of the bag). There is an array of items which is denoting the weight of the item. ith index item weight is arr[i]. Given that every item weight is between 1 kg to 3 kg. You have to move all items from source to destination. Find out the minimum number of moves required to move all items.
1<=n(total number of items)<=10^5
(Hint:- Sort the array and apply two-pointer approach, in which the first pointer is denoting the first index of the array (minimum weight) and the second pointer is denoting the last index of the array (maximum weight)).
- Given an array with +ve and -ve values. Bob has to traverse the whole an array with an initial value of x. If the value is positive then Bob adds this value in x and if the value is negative then subtract value from x. So it may be possible that at a particular index of the array, Bob has a value of x <=0. So you have to help of Bob to find out minimum value of x such that x always remain >=1 for every index of the array.
(Hint: Find out what can be minimum -ve value possible for x that would be the answer.)
Those who solved all three questions or 2 complete and 1 partial (more than 10 test case) were shortlisted for the interview round (12 students were shortlisted).
Round 2: Interview
This round was totally based on coding questions. In this, the interviewer was only asking coding questions from every student.
(slight variation is that print sum of all nodes of maximum Binary Search Tree)
(interviewer was very friendly and he gave me a hint to solve 3rd question and finally, I solved it).
8 students are shortlisted for further rounds.
Round 3: Interview
Interviewer studied my resume and asked about my projects (briefly). Then he started to ask Operating System questions.
- What are process and thread? Difference between them. Real life example of them. Assume you are given four threads which take 1 sec to execute completely and given is 1 CPU with one core processor. How much time will the processor take to execute all threads? Now, what will be the effect on the execution of threads of different priority or the same priority if all threads come at the same time? Now if the single-core processor is changed to a dual-core processor, quad-core processor then what will be the time of executing all threads. Now change 1 CPU to 2 CPU, 4 CPU with a single-core, dual-core, quad-core, octa-core processors, now what will be the time to execute all threads.
(I give all answers with patience, I did not know answers which I gave were correct or not).
- What is Deadlock?
- Puzzle: https://www.geeksforgeeks.org/puzzle-13-100-prisoners-with-redblack-hats/
6 students were shortlisted for the further rounds.
Round 4: Interview
- The Interviewer asked me to introduce myself. Asked about the first project which was written in my resume.
A thorough discussion went on for about 30-35 minute over the project. Questions were like – how to implement a particular feature in it. If I changed it what will effect on project or on output.
- He asked me whether I knew object-oriented programming or not. I said yes but he did not ask any questions over it.
- He moves over DBMS which was written in my resume. Asked about what is normalization, why it is used. Types of normal forms and details about every normal form. How to resolve if any table does not follow particular normal from.
- Design a database schema of college time table, which has attributes like teachers, students, classrooms, courses, every year (from 1st year to final year ). How to normalize it. How the tables will look like and how will they be related to one another.
- finally asked me do you have any questions.
5 students are shortlisted for further round.
Round 5: (HR round)
- Introduce yourself, talk about your family background
- Name of your dream company and why.
- Names of adobe product in the market.
- A Brief discussion about my project.
- What do you want to change in Adobe photoshop?
- What do you expect from Adobe?
- Why did you not do an internship?
- Why do you want to join Adobe?
- What types of companies you would prefer to work?
- Strengths and weakness.
- Asked CEO name of Adobe (I did not remember it at that time :p ).
- Gave a chance to ask any question from my side.
Finally, 4 students are selected for a full-time role and I was one of them.
- Adobe Interview Experience | Set 30 (Off-Campus For Member Technical Staff)
- Adobe Interview Experience | Set 49 (For Member of Technical Staff)
- Oracle Apps Interview Experience (On Campus) for Member Technical Staff
- Oracle Interview Experience for Member of technical staff
- ADP Interview Experience for Member Technical Role | On-Campus
- ADP Interview Experience for Senior Member Technical | On-Campus
- National Instruments(NI) Interview Experience for Staff Software Engineer
- Druva interview experience | Staff Software engineer -Development
- Adobe Interview Experience (Adobe for Women)
- Infosys Interview Experience - Technical Round
- Safegold Interview Experience | Technical Internship
- DBS Technical Associate Hiring Experience 2020
- Adobe Interview Experience for MTS-1 (1.5 Years Experience)
- Adobe Interview Experience | Computer Scientist (5 yr Experience)
- Credit Suisse Interview for Technical Analyst through Global Coding Challenge
- Adobe Interview Experience | Set 18 (For WBT Profile)
- Adobe Interview Experience | Set 19 (For MTS)
- Adobe Interview Experience | Set 21 for Software Engineer (Fresher)
- Adobe Interview Experience | Set 22 (On-Campus)
- Adobe Interview Experience | Set 23 (1 Year Experienced)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.