Loyalie IT Solutions Software Developer Intern Interview Questions and Answers

Easy to medium level of leet code

Q1. 1. Fibonacci series with recursion and without recursion 2. String Palindrome 3. Count all repeated numbers from the array
Ans. 
Answering questions related to Fibonacci series, string palindrome, and counting repeated numbers in an array.
• For Fibonacci series with recursion, write a function that calls itself to calculate the next number in the series.

• For Fibonacci series without recursion, use a loop to calculate the series.

• For string palindrome, compare characters from start and end of the string.

• To count all repeated numbers from the array, u
Answered by AI
View 2 more answers

Q1. 1.Given an array(0-based indexing), you have to find the max sum of i*A[i] where A[i] is the element at index i in the array. The only operation allowed is to rotate(clock-wise or counter clock-wise) the ...read more
Ans. 
Rotate array to find max sum of i*A[i]
• Rotate array to bring maximum element to front

• Calculate sum of i*A[i] for each rotation

• Keep track of maximum sum found
Answered by AI
Add your answer

Q1. 1.Oops concepts 2.Oops code 2.About Java Spring 3. Array stack questions 4.Project discussion
Add your answer

Round duration - 24 hours
Round difficulty - Medium

Round duration - 120 Minutes
Round difficulty - Medium

It was a Data Structures and Algorithm Round and Discussion on My assignment round to check my Problem Solving Skills.
And the Interviewer was very friendly to me. I first introduced myself to the interviewer and what did I have done in past as a Software Engineer and Why I want to work in Grofers.
 

Q1. 
Top View of Binary Tree
Given a binary tree of integers, the task is to return the top view of the given binary tree. The top view of the binary tree is the set of nodes visible when viewed from the top.
...read more
Ans. Using Pre-Order Traversal
As we know that all three traversals, i.e. pre-order, in-order and post-order, visit the tree node at once. We can use any of them. Here we are going to use pre-order traversal for the explanation. So while traversing in the pre-order traversal, we will keep track of horizontal distance of the node which is going to be visited from the root node, and we also keep track of the vertical level of ...read more
Answered Anonymously
Add your answer
Q2. 
Maximum Possible Time Problem Statement
Given an array ARR consisting of exactly four integer digits, your task is to form the maximum possible valid time in a 24-hour format using those digits.
Explanat...read more
Ans. Maximum Possible Time
Approach:
• The basic idea is that we will iterate over all the permutations of the 4 digits and check whether we are able to form a valid 24 Hr format time. If so we will then also find the maximum possible time.
• Here we will use the ‘NEXT_PERMUTATION’ method to find all the permutations.
 
Algorithm:
• There are two conditions for valid 24 Hr format time:
  • The first two digits i.e the hour should be le...read more
Answered Anonymously
Add your answer

Q1. DSA question with Some Stack
Add your answer
Q2. Discussion around Current project
Add your answer

Q1. Managerial discussion around resume and some basic java and spring question
Add your answer
Q2. Java and spring boot question
Add your answer