Livlong 365 Software Engineer Level 1 Interview Questions and Answers for Experienced

Easy Question on String manipulation and Patterns, series programs.

It was an easy test. Multiple choice questions bases on java

Q1. Asked oops concepts, collection, basic multithreading questions.
Add your answer

Q1. Asked some questions related to projects.
Add your answer

Round duration - 145 minutes
Round difficulty - Hard

The assessment consisted of four components, a code debugging section (20 minutes), a coding test (70 minutes), a workstyles assessment (20 minutes), and a reasoning ability section (35 minutes). The coding environment is very user-friendly and easy to use.

Q1. Rotate matrix to the right
You have been given a matrix ‘MAT’ of size 'N' * 'M' (where 'N' and 'M' denote the number of rows and columns respectively) and a positive integer...read more
Ans. Row-wise rotation
This approach is based on the fact that when we rotate an array to the right by ‘K’ times, it shifts ‘K’ elements from the end to the beginning of the array while the remaining elements shift towards the end. The effective rotations in ‘MAT’ can be from 0 to 'M' - 1, as we get the same matrix ‘MAT’ after every 'M' rotations. So, we will set ‘K’ to ‘K’ % ‘M’.
 
Now, we traverse ‘MAT’ row-wise. We wil...read more
Answered by CodingNinjas
Add your answer
Q2. Palindrome Partitioning
You are given a string 'S'. Your task is to partition 'S' such that every substring of the partition is a palindrome. You need to return all possible palindrome part...read more
Ans. Backtracking with Dynamic Programming
• We are iterating each time to check whether a given substring is palindrome or not and there we are iterating the same substring of string again and again. So there are overlapping subproblems.
• So we use dynamic programming. To overcome the overlapping subproblems we can initially create the DP table which stores if substring[i….j] is palindrome or not. We maintain a boolean dp[N][N]...read more
Answered by CodingNinjas
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

The online round was held on the Amazon Chime platform. The interviewer was very friendly and eager to know what I was thinking for every problem which he asked and always tried to make me speak up my thoughts and approach for solving the specific problem and understand my point too.

Q1. Form the Biggest Number
Given an array “A” of positive integers. Your task is to make the largest number possible formed by concatenating each of the array elements exactly once.
Example:
Let's say t...read more
Ans. Brute Force approach
The idea is to try out all the possible answers one by one and find out the largest one among all of them.
 
To implement this approach, we will generate all the permutations of the first 'N' positive integers and concatenate all the array elements in the order of the permutation.
 
For e.g. N=3 and array A = [ 3, 34, 7 ].
 
Let's generate all the possible answers using the permutations. Le...read more
Answered by CodingNinjas
View 2 more answers
Q2. Rat In A Maze
You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional plane). The maze would be given in the form of a...read more
Ans. Bactracking
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
 
Algorithm is as follows:
 
1. Take the starting position of th...read more
Answered by CodingNinjas
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

The online round was held on the Amazon Chime platform. The interviewer was very friendly and eager to know what I was thinking for every problem which he asked and always tried to make me speak up my thoughts and approach for solving the specific problem and understand my point too.

Q1.  Infix to Postfix
You are given a string EXP which is a valid infix expression. Convert the given infix expression to postfix expression.
Infix expression is of the form a op b. Where operator is is bet...read more
Ans. Stack
We will scan the expression from left to write and if we encounter an operand we will append it to our answer. If we encounter an operator we will pop all the operators with equal or higher precedence and append them to our answer. And push the current operator. In the end, we will empty the stack.
Order of precedence = [ ‘^’, ‘*’ and ‘/’, ‘+’ and ‘-’, ‘(’, ‘)’]
Order of precedence [ link ]
The algorithm will be-
1. ANS ...read more
Answered by CodingNinjas
Add your answer
Q2. Level Order Traversal
You have been given a Binary Tree of integers. You are supposed to return the level order traversal of the given tree.
For example:
For the given binary tree
The level order tra...read more
Ans. Breadth First Search
In the level order traversal, we will be using queue data structure which has the property FIRST IN FIRST OUT that’s why which nodes come first in current level the children of that node will also come first for the next level. So, we visit all the nodes one by one of the current level and push into the queue so that when we will be complete with the current level, then we can start exploring nodes ...read more
Answered by CodingNinjas
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

The online round was held on the Amazon Chime platform. The interviewer was very friendly and eager to know what I was thinking for every problem which he asked and always tried to make me speak up my thoughts and approach for solving the specific problem and understand my point too.

Q1. Fenwick Tree
You are given an array/list 'ARR' of ‘N’ integers, and ‘Q’ queries. Each query can be of two types:
Given 2 integers ‘L’,’R’ ( L>=0 and R<N ) find the sum of all the elements ...read more
Ans. Brute Force Approach
• The key idea of the approach is to process the queries as asked. i.e If range sum is asked we do a range sum using a loop and update the values in the array if it is an update query.
• Update will be a constant time operation but range sum can take time of order of ‘N’ .
 
We can take the following approach:
 
• For queries of type 1, we take a loop and iterate from ‘L’ to ‘R’ to find the sum and p...read more
Answered by CodingNinjas
View 3 more answers