Narvar India Software Engineer2 Interview Questions and Answers for Freshers

Basic maths question - given a number a and b get the nth number which is divisible by both a and b. And one sql query of concatinating the string in the column results.

Other - which movie you watched?
why do you watch?
who is your role model?
Why? What? How? Where?
Silly questions

Code the LRU cache on hacker rank

Q1. Code the tail -f logger
Ans. 
Implement a tail -f logger in code
• Use a file pointer to open the log file

• Read the file line by line and print new lines as they are added

• Use a loop to continuously check for new lines in the file
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The round was technical round and it was held on google meet around 1 pm

Q1. Maximum Sum Rectangle
You are given an M X N matrix of integers ARR. Your task is to find the maximum sum rectangle.
Maximum sum rectangle is a rectangle with the maximum value for the sum of integers pr...read more
Ans. Brute force
In this approach, we'll try to consider each rectangle that can be formed using elements of the array. To do this we fix (X1,Y1) coordinates of starting vertex and iterate through the matrix for every pair (X2,Y2) as the coordinates of ending vertex. Now we have a rectangle with coordinates (X1,Y1), (X1,Y2), (X2,Y1) and (X2,Y2).
We'll find the sum of elements within this rectangle and compare it with MAXSUM. ...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was managerial round and took place around 3 pm

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 betwe...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 Anonymously
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

I was MCQ + Coding round, Their were MCQ Based on DSA, Aptitude and 2 easy coding questions.

Q1. Ninja Competition
Our hero Ninja is organizing a coding competition where only two teams can participate simultaneously. To make the competition interesting and fair, both the teams should have an equal nu...read more
Ans. Brute Force
We will iterate from 1 to ‘N’ and count the number of even divisors and odd divisors. If they are equal, we will return true, else false.
 
Algorithm:
 
1. Declare two variables, ‘Odd_Count’ and ‘Even_Count’, and initialize them with zero.
2. Start iterating from 1 to ‘N’.
3. If the current iterator ( say i ) is a divisor of ‘N’ ( N % i == 0 ):
   1. If ‘i’ is odd, increase the ‘Odd_Count’ by 1.
   2. If ‘i’ is even, increase ...read more
Answered Anonymously
Add your answer
Q2. Help Bob Out!
Bob has just turned 18 years old and has opened a Bank account. However, since he has just opened his bank account he is not very experienced about the working of banks, therefore he asks for...read more
Ans. Brute Force
To check whether the string is a valid IFSC Code or not we can check every character of the string explicitly and check whether the string is in the correct format or not.
 
Algorithm:-
1. If the length of the string is not equal to 11, return False.
2. Else, iterate from the first index to the fourth index.
   1. Check whether the ASCII values of the characters lie between 65 - 90. If not, return False.
3. If yes, check wh...read more
Answered Anonymously
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.

Round duration - 50 minutes
Round difficulty - Easy

The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.

Round duration - 60 Minutes
Round difficulty - Easy

The platform was HackerEarth time duration was 1 hour.
2 Coding questions were asked, 30 minutes for each were allotted.

Q1. Longest Substring Without Repeating Characters
Given a string 'S' of length 'L', return the length of the longest substring without repeating characters.
Example:
Suppose given input is ...read more
Ans. Brute Force
In the brute force approach, we will use two nested loops. The outer loop is used to select the starting index of the substring and the inner loop is used to fix the ending index of the substring. After selecting the substring, we will use another loop (or a method) to check whether the substring contains all unique characters or not using a HashSet.
Space Complexity: O(n)Explanation:
O(L), where L is the len...read more
Answered Anonymously
Add your answer
Q2. Triplets with Given Sum
You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.
An array is said t...read more
Ans. Brute Force
• The most trivial approach would be to find all triplets of the array and count all such triplets whose ‘SUM’ = 'K'.
• We can find the answer using three nested loops for three different indexes and check if the values at those indexes sum up to 'K'.
• Create a set  to keep the track of triplets we have visited. Run first loop from i = 0 to i = ‘N’ - 3, second loop from j = i + 1 to j = ‘N’ - 2 and third loop ...read more
Answered Anonymously
Add your answer

Round duration - 120 Minutes
Round difficulty - Hard

This was a 2 hours round, with the following problem statement. At the end of the allotted time you had give a demo and explain your implementation.

Round duration - 45 Minutes
Round difficulty - Medium

The platform was Zoom, time duration was 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms and real life problems.

Round duration - 20 Minutes
Round difficulty - Easy

Interviewer was very friendly. Asked few questions about myself and then asked questions about what I know about the company.