Adobe Interview Experience | Set 39 (1.5 Years Experienced)

Last Updated : 12 Aug, 2024

Test Procedure: (Prior to interview date)
1. Online Written test.
Time: 1:30 hrs
Questions: 25(5- coding, 20- MCQ)

MCQs were aptitude, Operating systems and output questions
Coding were simple array manipulation.

2. F2F Interview(1 hrs) (Bangalore)
Q1: Find the diameter of the of binary tree with least complexity(O(n)).
https://www.geeksforgeeks.org/diameter-of-a-binary-tree/
Q2: Convert a binary search tree to balanced binary search tree(with and without rotation)

3. F2F Interview(1:30 hrs) (Bangalore)
Q1: Intro and explain project
Q2: Assume, there are millions of line in a file. Print the last K lines from that file.
Q3: Coin change problem(Normal solution and dynamic programming solution) https://www.geeksforgeeks.org/dynamic-programming-set-7-coin-change/
Q4: OS concepts- Virtual memory and Paging
Q5: Print Tree in the veritical form https://www.geeksforgeeks.org/print-binary-tree-vertical-order/
Q6: One pointer manipulation question in Linked list (forgot exact question :)).
Q7: Tell me about the design patterns that youhave used for your project. Explain their application.

4. F2F(video conferencing from Noida) Interview(1 hrs)
Q1: Intro and explain project
Q2: Difference between 32 bit and 64 bit OS
Q3: Explain the scenarios when C++ program might crash.
Q4: Optimize Linear search in an array for least number of comparison.
Q5: One more programming question regarding array. Can’t remember

5. Director’s interview: (Bangalore)
Q1: Intro and explain project
Q2: What you learned from your last project?
Q3: What will you avoid if you have to do it again.
Q4: How do you manage to succeed in It industry in spite of being from Electronics background
Q5: You have 4 byte integer. WAP to return the number of set bits in O(1) complexity. You could use some space if u need
Q6: Current offers and concerns regarding salary and job location.

I’d like to thank GeeksforGeeks for helping me during my interview preparations. Hope this helps. Please comment if any clarification is needed.

All Practice Problems for Adobe !

Anonymous

News

Improve

Previous Article

RazorPay Interview Experience for Senior Software Engineer (4 year Experienced)

Amazon Interview Experience | Set 281 (for SDE1)

Similar Reads

Adobe Interview Experience | Set 37 (3.5 Years Experienced)

Online Written Test 20 MCQ + 5 Coding Questions F2F 1 1. There are two sorted arrays . Find the median of array obtained by Merging these two arrays. https://www.cdn.geeksforgeeks.org/median-of-two-sorted-arrays/ 2. Find Transpose of a Matrix. 3. Tell me about Garbage Collection . I told him about GC process and different types of GCs available. Th

Adobe Interview Experience | Set 38 (4.6 Years Experienced)

Round 1: Q1. Implement memcpy function. How do you make compiler to give warning if user passes nomberOfBytes less then equal to zero. Q2. Write code to multiply two matrix. Q3. What is SIMD? Q4. What are different IPCs mechanisam. Q5. Find least common ancestor for N-ary tree, given pointer of two nodes. tree structure has parent pointer too. Q6.

Adobe Interview Experience (2 years experienced)

I interviewed with adobe for MTS profile. There were total of 4 rounds Round 1: Online coding round comprised of aptitude, output based questions and 2 coding questions. One was simple hash-map based and other was based on suffix tree. Round 2: F2F interview Interviewer asked me about my projects. I told him that i didn't had deep c++ knowledge as

Adobe interview experience (7 years experienced)

Round 1: 1) Given list of numbers which are sorted and have duplicates . find first occurrence of a number such that A[i] = i . We had a discussion on this . HE asked me to write unit test cases. code worked in case of no duplicates, duplicates which are smaller or greater than required element . His test case was like -100, -10, -20, 3, 3, 3, 3, 3

Adobe Interview Experience (5+ years Experienced )

Location: Noida Round 1: Asked about current project design. explained in detail. After that few DS and also questions followed-> a)-> implement LRU caching technique (solved using DLL) b)-> find k smallest numbers in coming stream of integers (solved using max heap) c)-> detect loop in a linked list. solved it using standard tortoise-h

Adobe Interview Experience (3+ years experienced)

Adobe has a great interview procedure based on my experience, the panel is knowledgeable, keen to know your approach, and is more involved in the complete discussion. Round 1: Coding round Q1. Clone an undirected graph. Q2. Find next greater number with the same set of digits Round 2: General/Project discussion Discussion around a problem statement

Adobe Interview Experience | 4 Years Experienced

Technical Round(1 hr): https://medium.com/algorithm-and-datastructure/delete-nodes-and-return-forest-13ac20c5a601https://www.cnblogs.com/lz87/p/13155351.html Technical Round(1 hr): Asked about Queue Data structure. Asked to write libraray for CyclicQueue class having 4 APIs: enqueue, dequeue, getFront, getRear. I wrote the class, he pointed out som

Adobe Interview Experience | 4 Years Experienced

Technical Round(1 hr): Problem-solving skills checked in this round Similar to https://www.geeksforgeeks.org/closest-perfect-square-and-its-distance/. I was asked to find square root of closest number without using sqrtRoot() func. For Ex: Input:10 Output:3 Input:15 Output:4 https://www.geeksforgeeks.org/block-swap-algorithm-for-array-rotation/. I

Adobe Interview Experience | 4 Years Experienced

Technical Round(1 hr): C++ problems asked in this round C++ Output-Based problems: C/C++ Code class Base{ public: Base(){ cout<<"base called "; } }; class Derived{ Base b; public: Derived(){ cout<<"derived called\n"; } }; int main(){ Derived d; return 0; } What will be the output and why? new and delete concept relat

Adobe Interview Experience | 4 Years Experienced

Round 1(Technical Round): It is purely technical round. It consists of two problem-solving questions and some OS-related questions. https://www.geeksforgeeks.org/given-a-binary-tree-print-all-root-to-leaf-paths/https://www.geeksforgeeks.org/check-if-a-word-exists-in-a-grid-or-not/Virtual Memory conceptsPage Table and TLB concepts Round 2(Technical

Adobe Interview Experience | MTS-2 (1.5 years experienced)

Round 1: It was an online test time duration for this round was 75min. We were given 22 questions that conations: 15 aptitude logical reasoning questions. 5 C++ questions. 2 coding questions. Given a list of names and votes… output the winner with maximum votes. Consider a string, s = “abc”. An alphabetically-ordered sequence of substrings of s wou

Adobe Interview Experience for MTS-1 | 1.5 Years Experienced

Round 1[Technical]: Given two independent processes P1, P2. P1 creates an array of size say n. It now waits, and suppose P2 starts, if it knows the address location of array from P1, can it access this array and modify it? Ans: No, to modify there should be some IPC mechanism between them. Read about IPC mechanisms.Some discussion on virtual memory

Adobe Interview Experience | Set 23 (1 Year Experienced)

I recently interviewed at Adobe, Noida office and got the offer. I had 1-year work experience. It was a standard process comprising of an aptitude and technical test on Hackerrank. It's the same every time. You can have a look at the test in previous archives. Screening Aptitude Test Technical Test having 13 MCQs and 7 standard coding questions. In

Adobe Interview Experience | Set 45 (For 2.5Years Experienced)

Adobe visited Hyderabad for a recruitment drive. Interviews were held in Novotel convention center. F2f 1(1.5 hours) The interviewer started with the discussion about current company and project. Then he asked me some basic DS and algo questions: Given an array, find all sets of 3 numbers whose sum equals to 0 He asked me to write merge sort code a

Cadence Interview Experience | Set 3 (For 6 Years Experienced)

Round 1: Loop in linked list [Iterative + recursion] {Why fast pointer is moved only by 2} Strtok function { Thread, Process, PCB table}, Can strtok be used with threads virtual table advantage and disadvantage puzzle https://puzzling.stackexchange.com/questions/2230/divide-a-rectangle-with-a-rectangular-hole-into-two-equal-parts [some hints provid

Microsoft Interview Experience | Set 154 (For 1.5 Years Experienced)

I applied for the position of Software Engineer at Microsoft IDC, Hyderabad, given 1.5 years of my experience. My rounds were of intermediate level I guess. Round 1: Hackerrank test There were 1 questions in this round. 1.) First question was based on strings. Given a string of characters, there will be a roll function given to you. The roll functi

PayTm Interview Experience | Set 23 (For 2 Years Experienced)

Round 1: First round was taken on mettl, online judge. There was two questions and that required to be done in 1hr 1. A paragraph which contained some dates in format DD-MM-YYYY, find number of distinct years in the paragraph. For e.g Some random words with date 12-01-1990 and some more words with date 12-12-2017 and again some random words with sa

Vizury Interview Experience | Set 2 (1.5 Years Experienced)

Vizury I got contacted by a recruiter on LinkedIn for Bangalore location. Telephonic round (DS and Algorithms) (1 Hour): 1) Print the level order traversal in reverse. https://www.geeksforgeeks.org/reverse-level-order-traversal/ I gave Stack and Queue Solution. Then he asked if I can think in terms of recursion, which I was unable to. 2) Create the

Nearbuy Interview Experience | Set 4 (2 Years Experienced)

Round 1: It was a HackerRank coding round with 3 questions (DP, string manipulation) (1 hr) Don't remember exact questions. Round 2: It was a F2F Technical round(1 hr) Your projects in previous company. Technologies you have used Java, OOPs questions on inheritance, abstraction, interface, collections Given two string check whether second string is

Mentor Graphics Interview Experience | Set 1 (1+ years experienced)

Interview 1 (45 mins) Q1) write a function that returns a different string every time it is called. Answer just return the time in the form of a string. Then the question was changed - what if two different computers were calling the same function at the same time? Answer append the computer ID (or IP) to the string. Then the question was again cha

British Telecom Interview Experience | Set 1 (1+ years experienced)

First Round (written) There were multiple choice questions on Aptitude and Java. Three marks for correct answer and -1 for wrong answers. 1. Aptitude questions were lengthy and tough. But the cutoff will be less. 2. Java questions were comparatively easy. A lot of questions were from multi-threading. Second Round (Technical interview) 1. What is ob

Cloud Lending Interview Experience | Set 1 (For 2.5 Years Experienced)

I attended an Interview with Cloud Lending at Bangalore. As they were having requirement in Salesforce so they asked me to have the interview in OOP and DS. Although, I am having 2.5 years of experience in C#. Round 1: Face to Face interview. 1. Tell me about yourself. 2. Rate yourself in DS and OOP and explain why? 3. What the difference and simil

Oracle Interview Experience | Set 45 (For 3 Years Experienced)

Oracle 3 years Java Experienced Kolkata location. I attended 2 rounds. Round 1 List prime factorization of numbers from 1 to 10000 List Armstrong Numbers from 1 to 500 Write 5 features from 5 classes of Collection Framework Find missing number from given Pattern. It was easy but right now I cannot remember the exact pattern Round 2 Find Middle elem

Cisco Interview Experience | Set 17 (For 1.5 Years Experienced)

After online HackerRank test 1st round OS concept like virtual memory, types of memory, diff between cache memory and main memory Explain system call, printf( ) how it will work? C concepts - static variable VS Global variable, static global variable, bit to hex , bit problems like set and swap bit of Integer , structure padding , volatile variable

OYO Interview Experience | Set 11 (For 2 years experienced)

Round 1: Skype Questions mostly on the technology you have worked on and algorithms. Algo: Find pair in BST which sums to X. Round 2-5 (in person) Round 2: 1. Implement stack using queue. 2. Left view of Binary Tree And few Java concepts questions. Round 3: 1. Problem statement: Given a log file with sessionID, source pageId, destn pageID and Times

Paytm Interview Experience | Set 18 (For 2 Years Experienced)

Hi all, below are the questions asked in paytm interview for 2yr experienced guy in java technology. I could remember these much only, although there were more questions. Round 1: Explained previous projects. Interfaces vs abstract class interface i1 : void fun() interface i2 : int fun() interface i3 : Object fun(int x) class implementing all these

Amazon Interview Experience | Set 245 (For 2.5 Years Experienced)

Round 1: Q-1 Given an array os 0s and 1s, and another input m, I was supposed to tell the longest continuous streak of 1s after flipping m 0s to 1s. E.g., Array is {1,1,0,0,1,1,1,0,1,1} m = 1 (which means I can flip ‘m’ one 0 to 1) Answer: 6 (if we flip 0 at index 7, we get the longest continuous streak of 1s having length 6) Q-2 Given N ropes of l

Amazon Interview experience | Set 334 (For 4.5 Years Experienced)

Round 1: Given binary tree. Find level with maximum sum List of modules with Dependencies given. Order the execution of modules (Topological sort) Round 2: Questions on Projects, Managerial questions Design Chess game. After basic design, complicated things by adding various functionalities Round 3: Deep design level discussion on one project that

Amazon Interview Experience | Set 340 (3.5 years experienced for SDE 1)

Recently I have gone through interview with Amazon Chennai for Amazon FIRE TV team. Here is my positive experience. Round 1(written): 1. Run Length Encoding 2. Find k-th smallest element in BST (Order Statistics in BST) 3. Substrings with similar first and last characters Round 2: 1. Level order traversal in spiral form 2. It's a two player game. B

Amazon Interview Experience | Set 347 (1.8 Years Experienced for SDE1)

Below is the summary of interview round conducted by amazon. Although i am not able to remember correctly since its almost 2 months. Written Test Check if Linked list contains loop. GeeskforGeeks Link Create Balanced binary search tree from sorted array GeeksforGeeks Link F2F (Technical) Stream of coordinates are given. you need to identify k neare

Article Tags :

Practice Tags :

Adobe