Ascendion Intern Interview Questions and Answers

Paper pen coding test

Q1. Easy-medium level sliding window problem
Ans. 
Find the maximum sum of a subarray of size k in an array of integers.
• Use a sliding window approach to keep track of the sum of the current subarray.

• Slide the window by adding the next element and subtracting the previous element.

• Keep track of the maximum sum encountered so far.

• Return the maximum sum found.
Answered by AI
Add your answer
Q2. Easy-medium level array problem
Ans. 
Find the longest common prefix among an array of strings.
• Iterate through the characters of the first string and compare with other strings.

• Stop when a character doesn't match or reach the end of any string.

• Return the prefix found so far.
Answered by AI
Add your answer
Q3. Gave me a condition and asked what data structure i would use. Problem was related to data retrieval so we would use hashmaps.
Add your answer
Q4. They also asked sql queires and dbms related concepts (ACID, etc)
Add your answer