# Adobe Interview Experience | Set 27 (On-Campus for Internship)

• Round 1: Online Round 60 min.
• 6 Aptitude Questions: (1 point each)
• 2 coding questions:( 2 points each) (only pseudocode)
1. Given the ID, starting time and ending time of racers, Output the no. of racers whose starting time is greater and ending time is less than a racer.
2. Given a BST output the rank of the element in that tree in less than O(n) time. The rank of an element is the index of element when all the elements of the tree are in sorted order. eg 4 5 6 7 8 ; rank of 5 is 1, rank of 4 is 0;
• 1 Writing Question ( 3 points) Imagine that self-driving technology has been achieved. Describe the ecosystem surrounding such a world and what technological break-through do you think that would have evolved by that time.
Around 15 students were shortlisted based on the Cumulative of the score in the first round and C.G.P.A
• Round 2 (Telephonic Interview) 30 min.
• First of all, he asked me to Introduce myself. Then he asked the configuration of my laptop.
• Interviewer: A recursive function has no termination condition. What will happen when it runs.
• Me: Stack overflow.
• Interviewer: Given a simple recursive function which calls itself:
```   eg: void f() {
f();
}```
How long will it run in your laptop.
• Me: I asked for certain assumptions. 1st: what stack space shall I assume?
• Interviewer: Half of RAM.(4 GB)
• Me: 2nd: I further assumed 4 bytes are required for addressing. time = (4 GB/ 4 Byte)/frequency; frequency-> processor speed (2.0 GHz) This is not an accurate solution… accuracy involves a lot other parameters. He was just checking my Approach that how I solve the problem. He further asked me about my favourite subject. I said Data Structures. He didn’t ask me even a single question related to data structures.
• Interviewer: What other courses have you done,.. Have you done OS?