AICL Software Developer Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

3 coding Questions:
1st : Easy question based on simple loop iteration
2nd :Medium level Dp question 
3rd : Medium level tree question(where we were not just required to complete the tree function but to build whole bst from 
scratch) 

It was conducted from 1:30 - 3:00 pm.
The coding platform was very good (as auto indentation and auto completion of brackets were there)
having camera on.

Q1. 
Selling Stock Problem Statement
You are given the stock prices for N days. Each day i signifies the price of a stock on that day. Your goal is to calculate the maximum profit that can be achieved by buyin...read more
Ans. 
Calculate maximum profit by buying and selling stocks on different days.
• Iterate through the stock prices and buy on the day when the price is lower than the next day's price, and sell on the day when the price is higher than the next day's price.

• Keep track of the total profit earned by summing up the differences between buying and selling prices.

• Return the total profit as the maximum profit that can be earned.
Answered by AI
Add your answer
Q2. 
Minimum Time to Burn a Binary Tree from a Leaf Node
You are given a binary tree with 'N' unique nodes, and a specific start node from where the fire will begin. The task is to determine the time in minute...read more
Ans. 
The task is to determine the time in minutes required to burn the entire binary tree starting from a given node.
• Traverse the tree from the given start node to calculate the time taken to burn the entire tree.

• Use a queue to keep track of nodes and their burning time.

• Increment the burning time for each level of nodes until the entire tree is burned.
Answered by AI
Add your answer

Round duration - 75-80 minutes
Round difficulty - Hard

This was a completely technical coding round where I was asked to solve the problems of data structures.
The codepad where i was asked to code was fine,
The interviewer was very friendly and was helpful and understanding.
I also asked him about his work and experience in the company and some other questions.

Q1. 
Matrix Maximum Path Sum Problem
Given an N*M matrix filled with integer numbers, your task is to find the maximum path sum starting from any cell in the first row and ending at any cell in the last row. Y...read more
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

It was held on Gmeet platform
The interviewer was very experienced person and was very nice too.
He made me comfortable by first introducing himself in a very detailed way and then asking me mine introduction
Since I feel that his internet connection was not very good so he turned off his camera but I decided not to turn off mine as in online interviews your face reviles your confidence 
the interviewer mostly asked me questions about my interests in technical field and the project that I have done

Round duration - 40 Minutes
Round difficulty - Easy

Round duration - 60 Minutes
Round difficulty - Easy

Q1. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. 
Reverse a given string containing alphabets, numbers, and special characters.
• Iterate through the string from the end to the beginning and append each character to a new string.

• Use built-in functions like reverse() or slicing to reverse the string.

• Handle special characters and numbers while reversing the string.

• Ensure to consider the constraints on the input string length and number of test cases.
Answered by AI
View 1 more answer
Q2. 
Max GCD Pair Problem Statement
Given an array of positive integers, determine the Greatest Common Divisor (GCD) of a pair of elements such that it is the maximum among all possible pairs in the array. The...read more
Ans. 
Find the maximum GCD of a pair of elements in an array of positive integers.
• Iterate through all pairs of elements in the array

• Calculate the GCD of each pair using Euclidean algorithm

• Keep track of the maximum GCD found

• Return the maximum GCD value
Answered by AI
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy

Q1. 1. JS questions - map, callback functions, higher order functions, coding on array/strings traversing and perform array/strings methods like to strong(), stringify(), push(), shift(), etc.
Add your answer
Q2. 2. React questions- go through normal top 100 interview questions like lifecycle, hooks, etc. and that's it.
Add your answer

Java, HTML, CSS, BASIC aptitude questions

Q1. Linked list code, core Java questions, project discussion
Add your answer

Q1. Compensation discussion
Add your answer

Core Java, HTML, CSS, BASIC aptitude questions

Q1. Linked list coding, CORE JAVA, Project discussion
Add your answer

Q1. Compensation discussion
Add your answer

Q1. SQL joins Views Cte
Add your answer
Q2. Cte Trigger Joins Complex query
Add your answer

Q1. Salary expectations
Add your answer

Q1. Whats your hobby
Ans. 
My hobby is photography, where I enjoy capturing moments and exploring different perspectives.
• I love experimenting with different camera settings and techniques

• I enjoy exploring new locations and finding unique angles to shoot from

• I like editing photos to enhance their visual appeal

• I often participate in photography contests and exhibitions
Answered by AI
Add your answer

Q1. Delegates and events
Add your answer