TO THE NEW Adobe AEM Developer Interview Questions and Answers

Basic aptitude ,logical and cs fundamental questions.

Q1. Asked about resume , projects , OOPs , and question to implement any sorting algo
Add your answer
Q2. Implement Bubble sort algorithm
Ans. 
Bubble sort algorithm sorts an array by repeatedly swapping adjacent elements if they are in wrong order.
• Compare adjacent elements and swap them if they are in wrong order

• Repeat this process until the array is sorted

• Time complexity is O(n^2)

• Space complexity is O(1)

• Example: ['apple', 'banana', 'orange', 'grape'] -> ['apple', 'banana', 'grape', 'orange']
Answered by AI
Add your answer
Q3. No question asked because no third technical interview.
Add your answer

Q1. Interview is based on projects , 1 technical question, and data structure choose question.
Add your answer
Q2. Check for balanced parenthesis.
Ans. 
Check for balanced parenthesis in a string.
• Use a stack to keep track of opening parenthesis

• If a closing parenthesis is encountered, pop from stack and check if it matches

• If stack is empty at the end, the string has balanced parenthesis
Answered by AI
Add your answer

Q1. Hobbies, strengths , weakness , future goals, etc.
Add your answer