Scaler Academy Software Development Engineer Intern Interview Questions and Answers for Experienced

Basic aptitude questions

Linked list, array, tree and graph questions

Q1. Data structures
Add your answer

Q1. System Design fundamentals
Add your answer

Q1. System Design questions
Add your answer

Q1. What do you think about the negative news going around the company
Add your answer

Q1. Why join this company
Add your answer

Q1. Low Level design on Quiz Portal Application
Ans. 
Designing a low level architecture for a quiz portal application
• Use a microservices architecture for scalability and flexibility

• Implement a database schema to store quiz questions, answers, and user responses

• Utilize caching mechanisms to improve performance

• Design an authentication system to ensure secure access to quizzes

• Include features for creating, editing, and taking quizzes
Answered by AI
Add your answer

Q1. Questions Based on Python
Add your answer

Q1. Salary Expectations and Joining Process
Add your answer

Q1. Machine coding round design drivezy app. It should be demoable.
Add your answer

Q1. Add 2 linked list and return final linked list
Ans. 
Add 2 linked lists and return final linked list
• Create a new linked list to store the sum

• Traverse both linked lists simultaneously and add the corresponding nodes

• Handle carry over while adding nodes

• If one linked list is longer than the other, add the remaining nodes to the sum list
Answered by AI
Add your answer
Q2. Find a Element in rotated sorted array
Ans. 
Finding an element in a rotated sorted array.
• Use binary search to find the pivot point where the array is rotated.

• Determine which half of the array the target element is in.

• Perform binary search on that half of the array to find the target element.

• Handle edge cases such as when the target element is at the pivot point.
Answered by AI
Add your answer

Q1. Matrix chain multiplication
Add your answer
Q2. Find word in matrix.
Ans. 
Given a matrix of characters and a word, find if the word exists in the matrix.
• Traverse the matrix and check if the first letter of the word matches any cell.

• If it does, check if the adjacent cells match the next letter of the word.

• Repeat until the entire word is found or no match is found.
Answered by AI
Add your answer

Q1. Stock buy sell problem to maximize profit.
Ans. 
Algorithm to maximize profit by buying and selling stocks.
• Iterate through the array of stock prices

• Keep track of the minimum price seen so far

• Calculate the profit if sold at current price

• Update maximum profit seen so far

• Return maximum profit
Answered by AI
Add your answer