Angel One Software Engineer Interview Questions and Answers

Round duration - 70 minutes
Round difficulty - Medium

Timing: 6:00 pm
3 coding questions of medium to be solved in 70 minutes.

Q1. 
Maximum Subarray Sum Problem Statement
Given an array of numbers, the task is to find the maximum sum of any contiguous subarray of the array.
Input:
The first line of input contains the size of the arr...read more
Ans. 
Find the maximum sum of any contiguous subarray in an array of numbers in O(N) time.
• Use Kadane's algorithm to find the maximum subarray sum in O(N) time.

• Initialize two variables: maxEndingHere and maxSoFar to keep track of the maximum sum.

• Iterate through the array and update the variables accordingly.

• Return the maxSoFar as the result.
Answered by AI
Add your answer
Q2. 
Closest Leaf in a Binary Tree
Ninja is stuck in a maze represented as a binary tree, and he is at a specific node ‘X’. Help Ninja find the shortest path to the nearest leaf node, which is considered an ex...read more
Ans. 
Find the minimum distance from a given node to the nearest leaf node in a binary tree.
• Traverse the binary tree from the given node 'X' to find the nearest leaf node.

• Use a queue for level order traversal to efficiently find the nearest leaf node.

• Calculate the distance from node 'X' to each leaf node and return the minimum distance.
Answered by AI
Add your answer
Q3. 
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
• 0 - representing an empty cell
• 1 - representing a fre...read more
Ans. 
Find the minimum time required to rot all fresh oranges in a grid.
• Use Breadth First Search (BFS) to simulate the rotting process of oranges.

• Track the time taken to rot all fresh oranges and return the result.

• If any fresh oranges remain after simulation, return -1 as it is impossible to rot all oranges.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Timing: 2:00 pm
Online round over google meet, code at google docs.
The interviewer was friendly, encouraging, and humble.

Q1. 
Smallest Integer Not Representable as Subset Sum
Given a non-decreasing sorted array ARR of N positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...read more
Ans. 
The task is to find the smallest positive integer value that cannot be represented as a sum of elements of any proper subset of the given array.
• The array is sorted in non-decreasing order, so we can iterate through the array and keep track of the maximum sum we can form.

• If the current element is greater than the maximum sum + 1, then the maximum sum + 1 is the smallest positive integer that cannot be represented.

• If all...read more
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Timing: 2:00 pm
Online round over google meet, code at google docs.
The interviewer was not speaking much. It was a bit strange.

Q1. 
Bottom Right View of Binary Tree Problem Statement
Your task is to identify and return the bottom right view of a given binary tree.
This involves viewing the binary tree from an angle of 45 degrees from...read more
Ans. 
Identify and return the bottom right view of a given binary tree by viewing it from an angle of 45 degrees from the bottom right side.
• Traverse the binary tree in a right-to-left manner and keep track of the last node encountered at each level.

• Use a queue for level order traversal and update the result array with the last node at each level.

• Return the result array sorted in ascending order as the bottom right view of th
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

Timing: 7:00 pm
The interviewer was friendly and in a bit of a hurry.

Round duration - 45 minutes
Round difficulty - Medium

I applied thorough LinkedIn and got a call from HR for the interview.
I went to their Noida Office.
First round was mainly focused on Javascript fundamentals.
Interviewer was also friendly.

Round duration - 1 hour
Round difficulty - Medium

Second round was after 15 minutes of the first round. The focus of this round was DS & Algorithms.

Q1. 
Find Subarray with Given Sum
Given an array ARR of N integers and an integer S, determine if there exists a subarray (of positive length) within the given array such that the sum of its elements equals S....read more
Ans. 
Given an array and a target sum, find a subarray that sums up to the target sum.
• Iterate through the array while keeping track of the running sum and the starting index of the subarray.

• Use a hashmap to store the running sum and its corresponding index.

• If the running sum - target sum is found in the hashmap, it means a subarray with the target sum exists.

• Return the starting and ending indices of the subarray or [-1, -1]
Answered by AI
Add your answer
Q2. 
Minimum Number of Platforms Required
You are provided with two arrays, AT and DT, representing the arrival and departure times of all trains arriving at a railway station.
Your task is to determine the m...read more
Ans. 
This question asks to find the minimum number of platforms required at a railway station so that no train needs to wait.
• Sort the arrival and departure times arrays in ascending order.

• Initialize a variable 'platforms' to 1 and 'maxPlatforms' to 1.

• Iterate through the arrival and departure times arrays simultaneously.

• If the current arrival time is less than or equal to the current departure time, increment 'platforms'.

• If ...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Q1. What JavaScript questions did he ask you during the managerial round, and can you describe the work culture of his team?
Ans. 
The interviewer asked about JavaScript questions and the work culture of the team during the managerial round.
• JavaScript questions related to closures, prototypes, event handling, and asynchronous programming may have been asked.

• Work culture may involve collaboration, innovation, agile methodologies, and continuous learning.

• Examples of work culture could include regular team meetings, code reviews, hackathons, and ment
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

Easy Medium questions

Q1. Asked to design Basic Facebook.
Add your answer

Q1. Low Level Design: How to do rate limiting for a platform serving 100K requests per second.
Ans. 
Implement rate limiting for a platform serving 100K requests per second.
• Use a token bucket algorithm to limit the rate of incoming requests.

• Set a maximum number of tokens in the bucket to control the rate.

• Refill the bucket at a constant rate to allow bursts of requests.

• Track the timestamp of the last request to enforce the rate limit.

• Consider using a distributed rate limiting system for scalability.

• Monitor and adjust t...read more
Answered by AI
Add your answer

Mcqs based on cs fundamentals and 2_3 coding questions

Q1. 2-3 DSA questions to be written on paper in the interview itself
Add your answer
Q2. Merge 2 sorted Linked list into 1
Ans. 
Merge two sorted linked lists into one.
• Create a new linked list to store the merged list.

• Compare the values of the nodes from both lists and add the smaller value to the new list.

• Move the pointer of the list with the smaller value to the next node.

• Repeat the comparison and addition until one of the lists is empty.

• Add the remaining nodes from the non-empty list to the new list.

• Return the new merged list.
Answered by AI
Add your answer

Q1. A full cv analysis interview round discussion on all the projects and team work experience
Add your answer