Online Aptitude Round

Online Aptitude Round consisted of 60 questions. I did about 40 questions with 90% accuracy.

Online Coding Round

Online Coding Round consisted of 2 questions related to arrays and strings (very easy).

One question was related to total number of palindromic strings.

For both questions, coding platform was CoCubes.

Those who did both the questions were called for the interview.

The interview day started with a written round.

WRITTEN ROUND

It consisted of 5 questions.

1. Something related to microprocessor (load, add etc)

2. https://www.geeksforgeeks.org/dynamically-allocate-2d-array-c/

3. Given n number of computers and connectivity between them (if computer a is connected to computer b or not). Write a program to find whether each computer in the network is connected to every other computer or not.

   
   
   
   

–It can be done by bfs or dfs.

4. Given a hexadecimal number in the form of a string. Convert it into decimal string.

5. Given an array. WAP to find the starting index of the subset whose sum is closest to zero.

TECHNICAL

Round 1

• https://www.geeksforgeeks.org/counting-inversions/

• https://www.geeksforgeeks.org/kth-largest-element-in-bst-when-modification-to-bst-is-not-allowed/

• Rain water trapping problem https://www.geeksforgeeks.org/trapping-rain-water/

• https://www.geeksforgeeks.org/find-a-repeating-and-a-missing-number/

• https://www.geeksforgeeks.org/find-two-missing-numbers-set-1-an-interesting-linear-time-solution/ Here the interviewer was more intereseted in xor based solution

• Product array puzzle

• The celebrity problem

• Best way to implement a dictionary ( detailed discussion about hashing, tries, and ternary search trees)

• https://www.geeksforgeeks.org/design-a-data-structure-that-supports-insert-delete-search-and-getrandom-in-constant-time/

• https://www.geeksforgeeks.org/design-a-stack-that-supports-getmin-in-o1-time-and-o1-extra-space/

• About bfs and dfs

• https://www.geeksforgeeks.org/count-possible-ways-to-construct-buildings/

Round 2

• Discussion on processes & threads and their workings

• About deadlock -conditions,prevention, and avoidance

• Given a Binary Tree, check if all leaves are at same level or not

• Implement your own sizeof()

• How does printf work with variable number of arguments (in compiler)

• https://www.geeksforgeeks.org/find-next-greater-number-set-digits/

• DBMS locks

• Arrange the digits 1 to 8 in a 2×4 matrix so that no two consecutive integers touch each other at a side or corner.

• Some more questions on trees

Round 3

• Implement Tower of Hanoi

• 1=3, 2=3, 3=5, 4=4, 5=4, 6=?

• Memory management in C

• DBMS locks

• Difference between http and https

• Critical section problem and synchronisation.

• File system in OS

• Difference between mutex and semaphore.

• Indexing

• Difference between macro and constant; and how they work in compiler.

• You are given 9 boxes, each contains 3 sacks. Each sack contains 100 coins where one of the coins is either heavier or lighter than the rest of the coins. Given a balance, how many weighings are required to deduce which sack contains the heavier/lighter coin?

• How does free() work in deallocating memory?

HR Round

• Why Adobe?

• What are your hobbies, strengths, and weaknesses?

• How do u react in stressful situations? and some other usual questions.

After this, I got waitlisted and after 4 months I got a call for one more interview.

Technical Round

• Reversing linked list (both iterative and recursive solutions)

• Detailed discussion about all of my projects

• Some puzzles

• Oops concepts

• I was asked to write a code explaining overloading and overriding.

• I was asked to write a python code for searching a particular string in each line of a given file.

• I was asked, how many lines of code have I written in java, python and c++.

• In how much time after 11 am, will both the minute and hour hand form an angle of 180 degree.

• Some more questions on linked list.

Then the last round was HR Discussion.

After about 5 days, I got the email stating that I’d been selected.

SOME SUGGESTIONS FOR ADOBE

Prepare from geeksforgeeks thoroughly, especially c concepts and data structures.

They focus more towards your approach and the confidence with which you speak.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.