AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Adobe Software Developer Interview Questions and Answers for Freshers
12 Interview questions
Minimize Cash Flow Problem
You are provided with a list of 'transactions' involving 'n' friends who owe each other money. Each entry in the list contains information about a receiver, sender, and the trans...
Minimize cash flow among friends by optimizing transactions.
Create a graph where nodes represent friends and edges represent transactions.
Calculate net amount each friend owes or is owed.
Use a recursive algorithm to settle debts by minimizing cash flow.
Update the graph after each transaction to reflect the new balances.
Repeat the process until all balances are settled.
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N mat...
Find all possible paths for a rat in a maze from source to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Explore all possible directions (up, down, left, right) from each cell.
Add the current direction to the path and recursively explore further.
When reaching the destination, add the path to the list of valid paths.
Minimum Fountains Activation Problem
In this problem, you have a one-dimensional garden of length 'N'. Each position from 0 to 'N' has a fountain that can provide water to the garden up to a certain range....
Find the minimum number of fountains to activate to water the entire garden.
Iterate through the array and keep track of the farthest point each fountain can cover.
Activate the fountain that covers the farthest point not covered by any previous fountain.
Continue this process until the entire garden is covered.
Return the count of activated fountains as the minimum number required.
Equalize Water in Buckets
You are provided with an array, ARR, of positive integers. Each integer represents the number of liters of water in a bucket. The goal is to make the water volume in each bucket e...
Given an array of positive integers representing water in buckets, find the minimum amount of water to be removed to equalize all buckets.
Sort the array in non-decreasing order to easily identify the buckets with excess water.
Calculate the average water volume by dividing the total water volume by the number of buckets.
Iterate through the array and calculate the excess water in each bucket compared to the average.
...
What people are saying about Adobe
Longest Common Prime Subsequence Problem Statement
Imagine Ninja is tackling a puzzle during his long summer vacation. He has two arrays of integers, each with lengths 'N' and 'M'. Ninja's task is to deter...
Find the length of the longest subsequence common to two arrays consisting only of prime numbers.
Iterate through both arrays and check if the numbers are prime.
Use dynamic programming to find the longest common subsequence of prime numbers.
Keep track of the length of the common prime subsequence.
Return the length of the longest common prime subsequence.
Split Array Problem Statement
You are given an integer array/list arr of size N. Your task is to split the array into the maximum number of subarrays such that the first and last occurrence of every distin...
Split the array into maximum number of subarrays such that first and last occurrence of every distinct element lies within a single subarray.
Iterate through the array and keep track of the first and last occurrence of each element.
Use a hashmap to store the indices of each element.
Count the number of subarrays where the first and last occurrence of each element are within the same subarray.
Split Array into 'K' Consecutive Subarrays Problem
Given an integer array arr of size N, determine if it is possible to split the array into K consecutive non-overlapping subarrays of length M such that ea...
The problem involves splitting an array into 'K' consecutive subarrays of length 'M' with each subarray containing a single distinct element.
Iterate through the array and check if each subarray of length 'M' contains only one distinct element.
Keep track of the count of distinct elements in each subarray.
Return 1 if it is possible to split the array according to the condition, otherwise return 0.
Morty's Array Challenge
Rick has provided Morty with an array 'Arr' of length 'N' and an integer 'K'. Morty needs to split the array into non-empty sub-arrays to achieve the minimum possible cost, subject ...
The challenge involves splitting an array into sub-arrays to minimize cost based on unique elements and repetitions.
Iterate through the array and keep track of unique elements and repetitions
Calculate cost for each sub-array based on the rules provided
Sum up the costs for all sub-arrays to get the total minimum cost
Maximum Meetings Problem Statement
Given the schedule of N meetings with their start time Start[i] and end time End[i], you need to determine which meetings can be organized in a single meeting room such t...
Given N meetings with start and end times, find the maximum number of meetings that can be organized in a single room without overlap.
Sort the meetings based on end times.
Iterate through the sorted meetings and select the next meeting whose start time is greater than or equal to the end time of the previous meeting.
Return the selected meetings in the order they are organized.
Equilibrium Index Problem Statement
Given an array Arr consisting of N integers, your task is to find the equilibrium index of the array.
An index is considered as an equilibrium index if the sum of eleme...
Find the equilibrium index of an array where sum of elements on left equals sum of elements on right.
Iterate through the array and calculate the total sum of elements.
For each index, calculate the sum of elements on the left and right side and check for equilibrium.
Return the left-most equilibrium index found, or -1 if none exist.
Adobe Software Developer Interview Experiences for Freshers
3 interviews found
Anonymous
I appeared for an interview in Jan 2021.
(2 Questions)
Round duration - 40 minutes
Round difficulty - Easy
It was in the morning. The 1st round was online coding + MCQ round. It had 3 sections in total to be solved in 40mins.Questions were mainly from Data structure, OS, DBMS, SQL.
- Q1.
Morty's Array Challenge
Rick has provided Morty with an array 'Arr' of length 'N' and an integer 'K'. Morty needs to split the array into non-empty sub-arrays to achieve the minimum possible cost, subject...
- Ans.
The challenge involves splitting an array into sub-arrays to minimize cost based on unique elements and repetitions.
Iterate through the array and keep track of unique elements and repetitions
Calculate cost for each sub-array based on the rules provided
Sum up the costs for all sub-arrays to get the total minimum cost
- Q2.
Longest Common Prime Subsequence Problem Statement
Imagine Ninja is tackling a puzzle during his long summer vacation. He has two arrays of integers, each with lengths 'N' and 'M'. Ninja's task is to dete...
- Ans.
Find the length of the longest subsequence common to two arrays consisting only of prime numbers.
Iterate through both arrays and check if the numbers are prime.
Use dynamic programming to find the longest common subsequence of prime numbers.
Keep track of the length of the common prime subsequence.
Return the length of the longest common prime subsequence.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
It was conducted in the evening around 4:30PM-5:30PM. Questions were bit difficult. Questions were mainly from Data Structures and there was total of 3 questions.
- Q1.
Split Array Problem Statement
You are given an integer array/list
arrof sizeN. Your task is to split the array into the maximum number of subarrays such that the first and last occurrence of every disti... - Ans.
Split the array into maximum number of subarrays such that first and last occurrence of every distinct element lies within a single subarray.
Iterate through the array and keep track of the first and last occurrence of each element.
Use a hashmap to store the indices of each element.
Count the number of subarrays where the first and last occurrence of each element are within the same subarray.
- Q2.
Split Array into 'K' Consecutive Subarrays Problem
Given an integer array
arrof sizeN, determine if it is possible to split the array intoKconsecutive non-overlapping subarrays of lengthMsuch that e... - Ans.
The problem involves splitting an array into 'K' consecutive subarrays of length 'M' with each subarray containing a single distinct element.
Iterate through the array and check if each subarray of length 'M' contains only one distinct element.
Keep track of the count of distinct elements in each subarray.
Return 1 if it is possible to split the array according to the condition, otherwise return 0.
Round duration - 20 minutes
Round difficulty - Easy
It was in the evening. Interviewer first ask simple questions to keep me calm and it was nice interaction with her the environment created by her was very interesting to answer
Interview Preparation Tips
Tip 1 : Even if you are stuck in the problem, just give a try. The interviewer will help you definitely for sure.
Tip 2 : Prepare Data Structures and Algorithms well. They mostly check our Problem Solving ability to find the solutions for the real world problems.
Tip 3 : Be enough confident, don't be nervous. Maintain atleast 2 projects in your resume
Tip 1 : Mention atleast 2 projects.
Tip 2 : Mention your skills in which you are perfect.
Tip 3 : It should not be too long or too short
Skills evaluated in this interview
I appeared for an interview in Nov 2020.
(2 Questions)
Round duration - 75 minutes
Round difficulty - Easy
This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.
1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes
This Round was Conducted on Hackerrank (Webcam Enabled).
- Q1.
Equalize Water in Buckets
You are provided with an array,
ARR, of positive integers. Each integer represents the number of liters of water in a bucket. The goal is to make the water volume in each bucket ... - Ans.
Given an array of positive integers representing water in buckets, find the minimum amount of water to be removed to equalize all buckets.
Sort the array in non-decreasing order to easily identify the buckets with excess water.
Calculate the average water volume by dividing the total water volume by the number of buckets.
Iterate through the array and calculate the excess water in each bucket compared to the average.
Sum u...
- Q2.
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
- Ans.
Find all possible paths for a rat in a maze from source to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Explore all possible directions (up, down, left, right) from each cell.
Add the current direction to the path and recursively explore further.
When reaching the destination, add the path to the list of valid paths.
(2 Questions)
Round duration - 100 minutes
Round difficulty - Medium
This was an Online F2F Technical Round conducted on CodePair : Hackerrank. So, Basically You have to Run and Submit ( Pass All Test cases) in the Interview Round also (Like normal Coding Test) in Codepair : Hackerrank & along with that You should have to explain your Code and Approach to the Interviewers.
The Interviewers were helpful and didn't hesitate in giving hints.
Timing - 10:00 A.M to 12:00 P.M
- Q1.
Minimum Fountains Activation Problem
In this problem, you have a one-dimensional garden of length 'N'. Each position from 0 to 'N' has a fountain that can provide water to the garden up to a certain range...
- Ans.
Find the minimum number of fountains to activate to water the entire garden.
Iterate through the array and keep track of the farthest point each fountain can cover.
Activate the fountain that covers the farthest point not covered by any previous fountain.
Continue this process until the entire garden is covered.
Return the count of activated fountains as the minimum number required.
- Q2.
Minimize Cash Flow Problem
You are provided with a list of 'transactions' involving 'n' friends who owe each other money. Each entry in the list contains information about a receiver, sender, and the tran...
- Ans.
Minimize cash flow among friends by optimizing transactions.
Create a graph where nodes represent friends and edges represent transactions.
Calculate net amount each friend owes or is owed.
Use a recursive algorithm to settle debts by minimizing cash flow.
Update the graph after each transaction to reflect the new balances.
Repeat the process until all balances are settled.
Round duration - 30 minutes
Round difficulty - Easy
This was a Telephonic Round (Audio Call). The HR was friendly and asked basic questions.
The timing was 2:00 PM to 2:30 PM.
Interview Preparation Tips
Tip 1 : Make sure that you are thorough with CS concepts beforehand.
Tip 2 : Even when you are explaining the approach to a question, try to parallelly think about how you would code it.
Tip 3 : Read the previous interview experiences. It would give a fair idea of the kind of questions one should expect.
Tip 4 : For a company like Adobe, practicing medium difficulty level coding questions would be the way to go.
Tip 5 : Practice atleast 200 questions from coding platforms like CodeZen, LeetCode, Interviewbit as they contain common interview questions.
Tip 1 : Mention atleast 1 project and past work experience as it sets good impression.
Tip 2 : Keep your resume up to date for the role you are applying.
Tip 3 : Try to keep your resume of 1 Page.
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 90 mintues
Round difficulty - Easy
Timing it is around 1 pm, Environment is very friendly.
- Q1.
Equilibrium Index Problem Statement
Given an array
Arrconsisting of N integers, your task is to find the equilibrium index of the array.An index is considered as an equilibrium index if the sum of elem...
- Ans.
Find the equilibrium index of an array where sum of elements on left equals sum of elements on right.
Iterate through the array and calculate the total sum of elements.
For each index, calculate the sum of elements on the left and right side and check for equilibrium.
Return the left-most equilibrium index found, or -1 if none exist.
- Q2.
Maximum Meetings Problem Statement
Given the schedule of N meetings with their start time
Start[i]and end timeEnd[i], you need to determine which meetings can be organized in a single meeting room such ... - Ans.
Given N meetings with start and end times, find the maximum number of meetings that can be organized in a single room without overlap.
Sort the meetings based on end times.
Iterate through the sorted meetings and select the next meeting whose start time is greater than or equal to the end time of the previous meeting.
Return the selected meetings in the order they are organized.
(2 Questions)
Round duration - 90 mintues
Round difficulty - Hard
Timing it is around 1 pm and Environment is good .
- Q1. Explain how to overload the pre and post-increment operators in object-oriented programming.
- Ans.
Overloading pre and post-increment operators in OOP involves defining special member functions for the class.
Define member functions for pre-increment (++obj) and post-increment (obj++) operators in the class.
For pre-increment, return a reference to the modified object after incrementing the value.
For post-increment, return a copy of the original object before incrementing the value.
Example: class Counter { int value; ...
- Q2.
Longest Zero Sum Subarray Problem
Given an array of integers consisting of both positive and negative numbers, find the length of the longest subarray whose sum is zero. This problem will be presented wit...
- Ans.
Find the length of the longest subarray with zero sum in an array of integers.
Iterate through the array and keep track of the running sum using a hashmap.
If the running sum is seen before, it means there is a subarray with zero sum.
Calculate the length of the subarray with zero sum and update the maximum length found so far.
Interview Preparation Tips
Tip 1 : Practice Atleast 500 Questions
Tip 2 : Do atleast 1 good projects
Tip 3 : You should be able to explain your project
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Skills evaluated in this interview
Interview questions from similar companies
I appeared for an interview before Mar 2021.
(2 Questions)
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
- Q1.
Reverse Words in a String: Problem Statement
You are given a string of length
N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o... - Ans.
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
Handle leading, trailing, and multiple spaces appropriately
- Q2.
Reverse a Stack Using Recursion
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...
- Ans.
Reverse a stack using recursion without using any extra space other than the internal stack space.
Use recursion to pop all elements from the original stack and store them in function call stack.
Once the stack is empty, push the elements back in reverse order.
Base case of recursion should be when the original stack is empty.
(2 Questions)
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
- Q1.
Convert a Binary Tree to its Mirror Tree
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...
- Ans.
Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.
Traverse the binary tree in a recursive manner.
Swap the left and right children of each non-leaf node.
Continue this process until all nodes have been processed.
- Q2.
Remove Nth Node from End of Linked List
You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...
- Ans.
Remove the Kth node from the end of a singly linked list.
Use two pointers approach to find the Kth node from the end.
Handle edge cases like removing the head node or removing the last node.
Update the pointers to remove the Kth node and reconnect the list.
Round duration - 30 minutes
Round difficulty - Easy
Typical Managerial round.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
What people are saying about Adobe
Interview Preparation Tips
Experience: Oracle had an online test which includes 3
Sections:
1. Programming: basic C++/java programming + data structure. One need to have good hand over oops
to score well in this section.
2. Aptitude: General Aptitude Questions
3. General Maths: Very simple maths problem (+2 level) but needs very very good speed.
Tips: Individual cutoff was not declared, but different cutoff for different profile is expected.
Oracle has no GD round.
Round: Interview
Experience: In 2nd round of interview, there was more programming, less resume based question and more emphasis on will I be comfortable in an IT sector. Some apti questions were also asked.
Round: Interview
Experience: 1st round was completely on resume based. Each and every project and intern is discussed in detail. Most of the extracurricular activities were also discussed. In the 1st interview, some basic program like fibonacci series by recursion, star pattern by loop etc were asked.
Round: Interview
Experience: Next round was HR. I was asked about the earlier 2 interviews and some basic HR questions.
College Name: IIT Roorkee
NITIN SAMANTA
Interview Preparation Tips
Experience: The sections were Quantitative, Logical, Verbal and Computer Science.The three sections contained very basic questions of general aptitude while the Computer Science section contained questions on Database Management, OS, SQL and Programming Aptitude.
Round: Test
Experience: The question was to program a logic to test the correctness of a solved sudoku. We were allowed to code in C++, Java, C or pseudo code.
Round: Technical Interview
Experience: Were asked simple questions and program them like reversing string without temporary variables, finding the earlier date when entered as string and finding the difference in number of days between them.
I was asked to explain him my internship project in great detail and above all one should be prepared to answer the question 'Why IT?' if from a non IT background. Then I was asked to program a logic for 'Search and replace" tool of MS Word.
Round: HR Interview
Experience: Was asked about my background in detail and stressed again and again on 'Why IT?'. Then he asked me to prepare a summary on the merits and demerits of various Employee Data Management techniques for an organisation. For the end of the interview you should have a question which you would ask to the interviewer.
General Tips: Don't try to over emphasize the correctness of your logic if the interviewer finds a glitch. It irritates him. Be interactive in your HR round. In our case it was the VP of Oracle India who took the final round. So I asked him about his experience in the company. He was very happy to share it with me. But asses your interviewer before you put forth these queries cause your interviewer might not be as jolly as mine was.
Skills:
College Name: NIT Surathkal
Interview Preparation Tips
Tips: If you think it is worth it, write it in the resume.
Round: Technical Interview
Experience: I discussed a political party in one such interview in another company. He was impressed rather inspired.
Tips: All they are looking for in this interview is that you have a basic aptitude
Round: HR Interview
Tips: Try to be as real as possible. They know people and have great deal of experience. You cannot fake it.
General Tips: Peace yoo
College Name: IIT BOMBAY
Interview Questionnaire
2 Questions
- Q1. Ques on SQL,puzzles, C
- Q2. Basic family background, hobbies, academics, why interest in software field, questions from the ppt they presentec earlier
Interview Preparation Tips
Experience: apti and logical reasoning ques were not tough and with basic knowledge on C and SQL I could easily solve the questions
Tips: Just try to maintain a good speed while solving
Round: Technical Interview
Experience: mostly they focus their questions based on the form that we had to fill. it had details about our extracurricular activities, main courses of interest, training and project work, software languages known, academics.
Tips: the form was to be filled with accuracy and only those points about which one is confident enough should be added
Round: HR Interview
Experience: it was just a normal interaction. they wanted to know the kind of person i am, my strengths and weakness. any impressive qualities unique of me. my favourite author. it lasted no longer than 10 minutes . and try to acquire as much background information as you about the company.
Tips: try to be honest with your answers. do not fake since they can easily catch you. do not give any such answers about which you are not confident or any view where you cannot defend yourself.
Skill Tips: I learned sql from w3school.com.
Skills: confidence, amicable nature, leadership qualities, participation in extracurricular activities, puzzle solving, Aptitude
College Name: NIT ROURKELA
Motivation: Its quite simple, I wanted to land with good job before i leave nit.
Funny Moments: Since it was the first time i was facing an interview, so i asked my interviewer how were my answers.
I appeared for an interview in Oct 2016.
Interview Questionnaire
5 Questions
- Q1. What is inheritance?
- Ans.
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
Inheritance allows for code reuse and promotes modularity.
The class that is being inherited from is called the superclass or base class.
The class that inherits from the superclass is called the subclass or derived class.
The subclass can access the public and protected members of the superclass.
Inhe...
- Q2. Regular expressions in PhP
- Ans.
Regular expressions in PHP are powerful tools for pattern matching and manipulating strings.
Regular expressions are defined using the preg_match() function in PHP.
They are used to search, replace, and validate strings based on specific patterns.
Regex patterns consist of a combination of characters and special symbols.
Modifiers can be added to the pattern to control the matching behavior.
Common regex functions in PHP in...
- Q3. What is polymorphism? Explain using a real life example
- Ans.
Polymorphism is the ability of an object to take on many forms. It allows objects of different classes to be treated as the same type.
Polymorphism allows a single interface to be used for different types of objects.
It enables code reusability and flexibility in object-oriented programming.
For example, a parent class 'Animal' can have multiple child classes like 'Dog', 'Cat', and 'Bird'. They can all be treated as 'Anim...
- Q4. Discussion about projects.
- Q5. Aggregate functions in dbms? And query questions related to that.
Interview Preparation Tips
Experience: 10 questions of aptitude containing English paragraph solving , Maths aptitude and also logical reasoning. Other 3 questions were of programming in any language comfortable.Two of the questions were partially done.In one of them only the logic was to be coded and in the other the error was to be corrected to give the correct output.
Duration: 1 hour 20 minutes
Total Questions: 13
Round: Technical Interview
Experience: They test your basic knowledge of programming, databases and how well you have worked with your projects.
There are actually three more rounds. 2 technical and one HR. I was not selected for them. Out of 40 students only 5 were selected after the final round.
Skills: Basic C/C++, DBMS, Multiple And Multi-level Inheritance, Polymorphism, PHP, Regular Expressions
College Name: Thapar University, Patiala
Skills evaluated in this interview
I appeared for an interview in Dec 2016.
Interview Questionnaire
8 Questions
- Q1. Given a 10 digit number, sort the individual digits of the number.
- Q2. Write code for LCA in Binary Search Tree.
- Ans.
The code for finding the Lowest Common Ancestor (LCA) in a Binary Search Tree (BST).
Start from the root node and compare it with the given two nodes.
If both nodes are smaller than the current node, move to the left subtree.
If both nodes are greater than the current node, move to the right subtree.
If one node is smaller and the other is greater, then the current node is the LCA.
Continue this process until the LCA is fou...
- Q3. Discuss a DBMS consisting of college faculty, professors, courses and students.
- Ans.
A DBMS for managing college faculty, professors, courses, and students.
The DBMS should have tables for faculty, professors, courses, and students.
Each table should have appropriate attributes to store relevant information.
Relationships can be established between tables using foreign keys.
Queries can be used to retrieve information about faculty, professors, courses, and students.
The DBMS can be used to track enrollment...
- Q4. What extra curricular activities did you do in college?
- Ans.
I was actively involved in coding competitions, hackathons, and programming clubs during college.
Participated in coding competitions such as ACM ICPC and Codeforces
Attended hackathons to work on real-world projects and improve problem-solving skills
Joined programming clubs to collaborate with peers and learn new technologies
- Q5. Do you seek for help if stuck in a problem?
- Ans.
Yes, I believe in seeking help when stuck in a problem as it leads to faster resolution and learning.
I believe in collaborating with team members to brainstorm solutions
I am not afraid to ask for help from more experienced developers
I utilize online resources like Stack Overflow or documentation when needed
- Q6. What do you understand by teamwork?
- Ans.
Teamwork is collaborating with others towards a common goal, utilizing each member's strengths and skills.
Collaborating with others towards a common goal
Utilizing each member's strengths and skills
Communicating effectively and openly
Respecting and valuing diverse perspectives
Sharing responsibilities and supporting each other
Celebrating successes as a team
- Q7. How do you tackle something that you can't find a solution to?
- Ans.
When faced with an unsolvable problem, I break it down, research, seek help, experiment, and iterate until a solution is found.
Break down the problem into smaller, manageable parts
Research and gather information related to the problem
Seek help from colleagues, online communities, or experts
Experiment with different approaches or solutions
Iterate and refine the solution based on feedback and results
- Q8. Where do you want to see yourself after 5 years?
- Ans.
In 5 years, I see myself as a senior software developer leading a team of developers on innovative projects.
Leading a team of developers on innovative projects
Senior software developer role
Continuing to learn and grow in the field
Interview Preparation Tips
Experience: The test had a time limit. Every 10 minutes you had to do atleast 4 questions. It was quite fast paced. The questions were from basic coding, aptitude and debugging.
Tips: Learn to be fast at coding. Study from geeksforgeeks.com. Practice a lot of aptitude questions. Have a decent knowledge of basic coding.
Duration: 1 hour
Total Questions: 20
Round: Technical Interview
Experience: The interviewer started off by asking basic sorting questions. Followed by data structures and algorithms. And DBMS related questions in the end.
Tips: Have a good presence of mind. Understand the question asked properly. Be confident and keep discussing. Don't get nervous and solve the questions incorrectly. Have good grip over topics like sorting, DS, Algorithms and DBMS.
Round: Managerial Interview
Experience: There was a discussion upon the company's work in fields like Big Data, IoT. They asked me in detail about the projects mentioned in my CV. Other skills mentioned in CV were also discussed.
Tips: Have a good understanding of the projects you have mentioned in your CV. Be polite and confident while answering. Keep a general awareness of the current technical scenario.
Round: HR Interview
Experience: The round was based around my over all personality. They checked how would I be an asset to their company. They analysed my core values and capabilities of working in a team.
Tips: Show that you are willing to work in a team. Be confident and polite. Express your feelings and passion towards your job and the company. Explain your college extra curricular activities well.
College Name: IIT Varanasi
Skills evaluated in this interview
Adobe Interview FAQs
Some of the top questions asked at the Adobe Software Developer interview for freshers -
The duration of Adobe Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
Tell us how to improve this page.
Adobe Interviews By Designations
- Adobe Software Developer Interview Questions
- Adobe Product Intern Interview Questions
- Adobe Computer Scientist Interview Questions
- Adobe Member Technical Staff Interview Questions
- Adobe Software Engineer Interview Questions
- Adobe Software Developer Intern Interview Questions
- Adobe Computer Scientist 2 Interview Questions
- Adobe Product Manager Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Developer Interview Questions
- Show more
Software Developer Interview Questions from Similar Companies
Adobe Software Developer Reviews and Ratings
based on 23 reviews
Rating in categories
|
Computer Scientist
492
salaries
|  ₹22.2 L/yr - ₹70 L/yr |
|
Technical Consultant
311
salaries
| ₹7.5 L/yr - ₹28.5 L/yr |
|
Computer Scientist 2
295
salaries
| ₹47.5 L/yr - ₹80 L/yr |
|
Software Engineer
278
salaries
| ₹8 L/yr - ₹30 L/yr |
|
Senior Software Engineer
245
salaries
| ₹23.1 L/yr - ₹43.1 L/yr |
Salesforce
Oracle
Microsoft Corporation
Amazon
- Home >
- Interviews >
- Adobe Interview Questions >
- Adobe Interview Questions for Fresher
