Filter interviews by
To find and remove a loop in a Linked List, we can use Floyd's Cycle Detection Algorithm.
Use two pointers, slow and fast, to detect if there is a loop in the Linked List
If the two pointers meet at some point, there is a loop
To remove the loop, set one of the pointers to the head of the Linked List and move both pointers one step at a time until they meet again
The meeting point is the start of the loop, set the next poi
Find the maximum window size to sort an unsorted array.
Identify the longest decreasing subarray from the beginning and longest increasing subarray from the end
Find the minimum and maximum element in the identified subarrays
Expand the identified subarrays until all elements in the array are covered
The length of the expanded subarray is the maximum window size
Finding the longest last occurring word in a sentence with multiple whitespace.
Split the sentence into words using whitespace as delimiter
Reverse the list of words
Iterate through the list and find the first occurrence of each word
Calculate the length of each last occurring word
Return the longest last occurring word
Merge sort and Quick sort are sorting algorithms used to sort arrays of data.
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half recursively, and then merges the sorted halves.
Quick sort is also a divide and conquer algorithm that selects a pivot element and partitions the array around the pivot, sorting the two resulting sub-arrays recursively.
Merge sort has a tim...
Process is an instance of a program while thread is a subset of a process that can run concurrently with other threads.
A process is a program in execution
A process can have multiple threads
Threads share the same memory space as the process
Threads can run concurrently with other threads within the same process
Examples of processes include web browsers, word processors, and media players
Examples of threads include GUI th
A recursive function calls itself until a base case is reached, then returns the result to the previous call.
Each call creates a new instance of the function on the call stack
The function continues to call itself until a base case is reached
Once the base case is reached, the function returns the result to the previous call
The previous call then continues executing from where it left off
Code to find number of combinations of reaching step N by ball falling from staircase with 1 or 2 steps per jump.
Use dynamic programming to solve the problem
Create an array to store the number of ways to reach each step
Initialize the array with base cases for steps 0, 1, and 2
Use a loop to fill in the array for steps 3 to N
The number of ways to reach step i is the sum of the number of ways to reach step i-1 and i-2
Retu
Priority queue is a data structure that stores elements with priority levels and retrieves them in order of priority.
Priority queue is implemented using a heap data structure.
Stack can be implemented using a priority queue by assigning higher priority to the most recently added element.
Queue can be implemented using a priority queue by assigning higher priority to the oldest element.
Implementing stack using queue involves using two queues to simulate stack behavior.
Create two queues, q1 and q2.
Push operation: Enqueue the element to q1.
Pop operation: Dequeue all elements from q1 to q2 except the last element. Dequeue and return the last element.
Swap the names of q1 and q2 after each pop operation.
Top operation: Return the last element of q1 without dequeuing it.
isEmpty operation: Check if both q1 a
I lost my job during the pandemic and struggled to find a new one
Applied to multiple job openings daily
Networked with former colleagues and industry professionals
Took online courses to improve skills
Maintained a positive attitude and stayed motivated
Eventually landed a new job in a different industry
I would have pursued a career in music or writing.
I have always had a passion for music and writing.
I have played multiple instruments since childhood.
I have written and published short stories and poetry.
I believe creativity is an important aspect of any profession.
I value my relationships with loved ones the most.
Spending quality time with family and friends
Making an effort to stay in touch with long-distance loved ones
Prioritizing important events and milestones in their lives
Being there for them during difficult times
Forgiving and working through conflicts to maintain strong bonds
Discussion on General Topics
General Aptitude test
Troubleshooting shooting on different scenarios involves identifying the root cause and implementing solutions.
Identify the specific issue or problem
Gather relevant information and data
Analyze possible causes
Implement solutions and test them
Document the troubleshooting process and outcome
I applied via Company Website and was interviewed in Oct 2024. There were 4 interview rounds.
Basic Python, SQL, and Bash questions
Data pipeline design involves creating a system to efficiently collect, process, and analyze data.
Understand the data sources and requirements before designing the pipeline.
Use tools like Apache Kafka, Apache NiFi, or AWS Glue for data ingestion and processing.
Implement data validation and error handling mechanisms to ensure data quality.
Consider scalability and performance optimization while designing the pipeline.
Doc...
I was interviewed in Jan 2025.
Social media impact on younger generations.
Social media usag in impacting businesses
I prioritize incidents based on impact, urgency, and SLA requirements.
Assess the impact of each incident on business operations
Determine the urgency of resolving each incident
Consider any SLA requirements for specific incidents
Use a ticketing system to track and prioritize incidents
Communicate with stakeholders to understand priorities
I approach Root Cause Analysis by gathering data, identifying contributing factors, analyzing trends, and implementing preventive measures.
Gather all relevant data related to the incident
Identify contributing factors through interviews, documentation review, and analysis
Analyze trends to determine common themes or patterns
Implement preventive measures to address root causes and prevent future incidents
Adobe interview questions for popular designations
I applied via Campus Placement
Patterns, quiz, game questions.
Modified unbounded knapsack problem involves maximizing the value of items with unlimited quantities and weight constraints.
Consider items with values and weights, along with a weight constraint
Dynamic programming can be used to solve this problem efficiently
Examples: Given items with values [60, 100, 120] and weights [10, 20, 30], and a weight constraint of 50, maximize the value
Get interview-ready with Top Adobe Interview Questions
I applied via Referral and was interviewed in Sep 2024. There were 2 interview rounds.
Find number of triplets in array whose sum is less than or equal to target.
Sort the array in ascending order.
Use three pointers to iterate through the array and find triplets.
Update pointers based on sum of triplets and target value.
I applied via Referral and was interviewed in Aug 2024. There were 3 interview rounds.
Project management drilling on processes involves closely monitoring and improving project workflows.
Regularly review and analyze project processes to identify bottlenecks and inefficiencies
Implement process improvements based on data-driven insights
Ensure team members are following established processes and provide training as needed
I was interviewed in Sep 2024.
I applied via Referral and was interviewed in Sep 2024. There were 2 interview rounds.
2medium level questions
I applied via Company Website and was interviewed in Aug 2024. There was 1 interview round.
The right view of a binary tree shows the nodes that are visible when looking at the tree from the right side.
The right view of a binary tree can be obtained by performing a level order traversal and keeping track of the rightmost node at each level.
Nodes that are visible from the right side are the ones that are the rightmost at their level.
Example: For the binary tree [1, 2, 3, null, 5, null, 4], the right view would
Encode and decode a string without using any delimiter.
Use a unique character to represent the start and end of each string in the array.
Keep track of the length of each string to properly decode it.
Example: ['hello', 'world'] can be encoded as '#hello#world#' without using delimiters.
It was really good, having required tech questions for my position
Top trending discussions
Some of the top questions asked at the Adobe interview -
The duration of Adobe interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 156 interviews
Interview experience
based on 1.1k reviews
Rating in categories
Computer Scientist
441
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Consultant
278
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
254
salaries
| ₹0 L/yr - ₹0 L/yr |
Computer Scientist 2
231
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Technical Consultant
204
salaries
| ₹0 L/yr - ₹0 L/yr |
Salesforce
Oracle
Microsoft Corporation
Amazon