AICL Software Developer Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Easy

The interviewer called my via phone and simultaneously provided me a link where I had to write the code for a given problem. It was scheduled at 12:30 pm, so timing was not an issue. It was a standard DP question involving a 2D matrix. The question was easy and I was able to code it within given time.

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me two coding questions in this round.

Q1. Write an efficient program to find the sum of the contiguous subarray within a one-dimensional array of numbers that has the largest sum.
Ans. 
Efficient program to find sum of largest contiguous subarray within a one-dimensional array.
• Use Kadane's algorithm to find the maximum sum subarray in O(n) time complexity.

• Initialize max_sum and current_sum to 0, iterate through array updating current_sum and max_sum.

• Return max_sum as the result.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was on-site round at their Bangalore office. The interviewer was friendly and helpful. The interview held inside a conference room.

Q1. 
DFS Traversal Problem Statement
Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...read more
Ans. 
DFS traversal problem to find connected components in an undirected and disconnected graph.
• Use Depth First Search (DFS) algorithm to traverse the graph and find connected components

• Maintain a visited array to keep track of visited vertices

• Iterate through all vertices and perform DFS on unvisited vertices to find connected components
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was the next round of the onsite interviews. Took place in the same conference room as that of the previous round.

Round duration - 60 minutes
Round difficulty - Easy

This was the third round of the onsite interview. 
 

Round duration - 120 Minutes
Round difficulty - Medium

Timing was 3PM to 5 PM
There were 4 coding questions based on Dynamic Programming , Graphs, Mathematical analysis , Trie data structure.

Q1. 
Weighted Job Scheduling Problem Statement
You have 'N' jobs, each with a start time, end time, and profit. Your task is to identify the maximum profit that can be earned by scheduling these jobs such that...read more
Ans. 
The Weighted Job Scheduling problem involves maximizing profit by scheduling non-overlapping jobs with start time, end time, and profit given.
• Sort the jobs based on their end times in ascending order.

• Initialize an array 'dp' to store the maximum profit that can be earned by scheduling jobs up to that index.

• For each job, find the maximum profit by either including or excluding the current job based on non-overlapping co...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

The interviewer was very soft spoken and helpful. There were in total 3 questions of easy-medium difficulty based on DP, Graphs and Sorting . It was around 11 AM timing.

Q1. 
Knight Probability in Chessboard
Calculate the probability that a knight remains on an N x N chessboard after making K moves. Initially, the knight is placed at a given position on the board. It can move ...read more
Ans. 
Calculate the probability that a knight remains on an N x N chessboard after making K moves.
• Use dynamic programming to calculate the probability of the knight staying on the board after each move.

• Consider all possible moves the knight can make from its current position.

• Keep track of the probabilities at each position on the board after each move.

• Normalize the probabilities at the end to get the final result.

• Example: Fo...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

The round had 1 DS and Algo problem and 1 system Design question based on building any management portal.

Q1. 
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...read more
Ans. 
Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.
• Use Breadth First Search (BFS) to find the shortest path from the starting cell to the last cell.

• Create a mapping of each cell to its corresponding destination cell if it contains a snake or ladder.

• Keep track of visited cells to avoid revisiting them during the traversal.

• Consider the constraints and handle cases where t...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It was more of Hiring Manager round where he asked about my skills , my projects and how could i be valuable to firm. It was quit easy going round

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Best Time To Buy and Sell Stock Problem Statement
You are given an array 'PRICES' of 'N' integers, where 'PRICES[i]' represents the price of a certain stock on the i-th day. An integer 'K' is also provide...read more
Ans. 
Determine the maximum profit achievable with at most K transactions by buying and selling stocks.
• Iterate through the array and keep track of the minimum price to buy and maximum profit to sell.

• Use dynamic programming to calculate the maximum profit with at most K transactions.

• Consider edge cases like when K is 0 or when the array is empty.

• Example: For input N = 6, PRICES = [3, 2, 6, 5, 0, 3], K = 2, the output should b
Answered by AI
Add your answer
Q2. 
Maximum Sum Rectangle Problem Statement
Given a matrix ARR with dimensions N x M, your task is to identify the rectangle within the matrix that has the maximum sum of its elements.
Input:
The first line...read more
Ans. 
Find the rectangle with the maximum sum of elements in a given matrix.
• Iterate through all possible rectangles in the matrix and calculate the sum of each rectangle.

• Keep track of the maximum sum encountered so far.

• Optimize the solution by using Kadane's algorithm for 1D array to find maximum sum subarray in each row.
Answered by AI
Add your answer
Q3. 
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...read more
Ans. 
Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.
• Use Breadth First Search (BFS) to find the shortest path from the starting cell to the last cell.

• Keep track of visited cells and the number of dice throws required to reach each cell.

• Consider the presence of snakes and ladders while calculating the next possible moves.

• Return the minimum number of dice throws to reach th
Answered by AI
Add your answer

Round duration - 70 Minutes
Round difficulty - Medium

Q1. 
Longest Increasing Subsequence Problem Statement
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...read more
Ans. 
Find the length of the longest strictly increasing subsequence in an array of integers.
• Use dynamic programming to solve this problem efficiently.

• Initialize an array to store the length of the longest increasing subsequence ending at each index.

• Iterate through the array and update the length of the longest increasing subsequence for each element.

• Return the maximum value in the array as the result.
Answered by AI
Add your answer
Q2. 
Longest Increasing Path in a 2D Matrix Problem Statement
Given a matrix of non-negative integers of size 'N x M', where 'N' and 'M' denote the number of rows and columns respectively, find the length of t...read more
Ans. 
Find the length of the longest increasing path in a 2D matrix by moving in four directions from each cell.
• Use dynamic programming to keep track of the length of the longest increasing path starting from each cell.

• Explore all four directions from each cell and recursively find the longest increasing path.

• Optimize the solution by storing the length of the longest increasing path starting from each cell to avoid redundant
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

Q1. 
Search In Rotated Sorted Array Problem Statement
Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
Note:
1. If 'K' is not present...read more
Ans. 
Given a rotated sorted array, find the index of a given integer 'K'.
• Use binary search to find the pivot point where the array is rotated.

• Based on the pivot point, apply binary search on the appropriate half of the array to find 'K'.

• Handle cases where 'K' is not present in the array by returning -1.
Answered by AI
Add your answer

Q1. Objects in java 8
Ans. 
Java 8 introduced the concept of functional programming with the addition of lambda expressions and streams.
• Lambda expressions allow for concise code and easier parallel programming.

• Streams provide a way to work with collections of objects in a functional style.

• Functional interfaces like Predicate, Function, and Consumer are commonly used with lambda expressions.
Answered by AI
Add your answer
Q2. Spring boot basic concepts
Add your answer

Q1. Coding challenge in java 8
Ans. 
Implement a coding challenge in Java 8
• Use lambda expressions and functional interfaces to write concise and readable code

• Utilize streams to process collections efficiently

• Leverage method references for cleaner code
Answered by AI
Add your answer
Q2. Personal project architecture questions
Add your answer

It was data structures and algorithm

Q1. What is friend function
Add your answer
Q2. Basic definitions of oops
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. 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