G R Infraprojects Full Stack Developer Interview Questions and Answers

Round duration - 70 Minutes
Round difficulty - Medium

This round consists of Aptitude questions, Java oops concepts MCQ questions, SQL questions, and 2 Coding questions

This round conducted around 11 AM

The environment is good, You can't change the window so googling the answers is not possible. you have to be quick to answer most of the questions, Don't spend too much time on 1 question, Just mark that question, so that if you have time you can complete it in the end

The interviewer was strict, no cheating allowed, Mobiles are kept in Bag

Q1. Reverse Integer
You are given a 32-bit signed integer ‘N’. So, the integer will lie in the range [-2^31, 2^31 - 1]. Your task is to return the reverse of the given integer. If reversing causes overflow, th...read more
Ans. Implementation
The idea is to use the fact that the input ‘N’ is a 32 bit signed integer.  So, as mentioned, -2147483648 <= ‘N’ <= 2147483647. In this range, for ‘N’ = 10  *  x + y, the ‘N’ can never attain a value when |x| = INT_MAX / 10, y = 8 or 9 for x > 0 and y = -9, for x < 0.
 
Therefore, it is sufficient to check |x| > INT_MAX / 10 (i.e. x > INT_MAX / 10 or x < INT_MIN / 10...read more
Answered Anonymously
Add your answer
Q2. Longest Common Prefix
You are given an array ‘ARR’ consisting of ‘N’ strings. Your task is to find the longest common prefix among all these strings. If there is no common prefix, you have to return an emp...read more
Ans. Iterative Scanning
In this approach, we will iterate through each character of the first string and check if the same character exists in each string or not. We will maintain a variable longestPrefix to store the longest common prefix.
 
We will traverse idx from 0 to the length of ARR[0] -1.
1. We will iterate index from 1 to N-1 and check if ARR[index][idx] is equal to ARR[0][idx].
2. If the condition is true for all strin...read more
Answered Anonymously
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

It was night when my interview was scheduled ,Interviewer asked the questions on SQL, Angular, DBMS,OOPS Concepts, Java programming, Operating system ,Some 1-2 is tough and others questions I answered very well, He asked me to explain oops concepts like polymorphism ,Encapsulation, Inheritance with the help of real life examples.He asked to code 1 pattern question at end.

Q1. Selection Sort
Selection sort is one of the sorting algorithms that works by repeatedly finding the minimum element from the unsorted part of the array and putting it at the beginning of the unsorted regio...read more
Ans. Selection Sort Approach
Selection sort is a standard sorting algorithm that uses nested loops to find all the minimum elements in the array in each iteration and swap them with the starting element of the unsorted region of the array.
 
Steps :
• Use a minValue variable to find the index of the minimum element of the array.
• Use a loop to iterate over all the elements of the array.
• Use a nested loop to find the minimum ele...read more
Answered Anonymously
Add your answer