Chetu Full Stack Developer Interview Questions and Answers for Freshers

Coding questions related to trees and graphs

Q1. Anagrams related
Add your answer
Q2. Sorting related
Add your answer

A groups of 10 were formed for GD

The question were very basic related to OOPS.

Q1. Tell me about yourself
Ans. 
I am a passionate software developer with experience in Java, Python, and web development.
• Experienced in Java, Python, and web development technologies

• Strong problem-solving skills

• Team player with excellent communication skills
Answered by AI
Add your answer
Q2. Motivation behind the move
Ans. 
I was motivated to move to this role because of my passion for coding and desire to work on challenging projects.
• Passion for coding and technology

• Desire to work on challenging projects

• Opportunity for growth and learning

• Interest in the company's products or services
Answered by AI
Add your answer

Q1. They will ask questions based on what you have mentioned in your resume
Add your answer

Q1. They have asked about my previous company project and questions related to that
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Test was conducted on Hackerearth. 
Test consist of 3 questions (1 medium strings related question + 1 hard digit dp question + 1 hard lazy segment tree question)

Q1.  Given a string, find the next smallest palindrome
You are given a number 'N' in the form of a string 'S', your task is to find the smallest number strictly greater than the given number &#...read more
Ans. Palindromic String
In this method, Before we start let us define what is the right half (or right part) and what is left half (or left part) in the string. There can be two cases based on the length of the string:
 
• Case-1: (Odd length string), consider the string “1234567”, the part of the string “123” is the left part(or left half) and the part “567” is the right part(or right half), and the one left(4) is called t...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Count all sub-arrays having sum divisible by k
Given an array ‘ARR’ and an integer ‘K’, your task is to find all the count of all sub-arrays whose sum is divisible by the given integer ‘K’.
Note:
If ther...read more
Ans. Brute Force (Time Limit Exceed)
The basic idea is that try each and every possible subarray and find the sum of the current subarray and check if the current sum is divisible by ‘K’. 
 
• To implement this approach we use two nested loops and one ‘COUNT’ variable to store all subarray with sum divisible by ‘K’ and initially ‘COUNT’ is ‘0’.
• Iterate outer loop ‘i’ from ‘0’ to ‘N-1’ for every position of ‘ARR’.
• Add che...read more
Answered by CodingNinjas
View 2 more amswers
Q3. Minimum Operations To Make Array Equal
You are given an array ‘ARR’ of length ‘N’ which is filled with the values such that ARR[i] = (2*i + 1). You have to perform operations on the ‘ARR’ to make all eleme...read more
Ans. Brute Force
• The idea behind this approach is we have to calculate the average of all the elements of the array ‘ARR’ because the sum of all elements of the array always remains constant.
• So calculating the average will help us to virtually divide the elements into two halves around the average i.e left and the right. So calculating the answer for the left half only will be our required answer. It is because in one operat...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 90 Minutes
Round difficulty - Medium

Timing : 8:00 am - 9:30 am
The interview took place on google meet. The interviewer gave 1 coding question on google docs and have to write the code on google doc itself.
After 45 minutes a second interviewer came in the same meeting and he also gave a coding question in the same google doc.

Q1. Rank from Stream
You are given an array of ‘N’ integers say ‘ARR’ and provided with other integer say ‘K’. Now you have to find the Rank of ‘ARR[K]’.
Note:
The rank of any element in ‘ARR’ is equal to t...read more
Ans. Binary Search Tree
The idea is to use the binary search tree.
 
First of all, we will make a binary search tree say ‘BST’ from the given array ‘ARR’ after this we can use ‘BST’ to find the rank of ‘ARR[K]’.
Each node of ‘BST’ will store the data value and size of its left subtree.
 
Here is the complete algorithm:
 
Step 1- Making the ‘BST’ :
 
Let insert(TreeNode* <int> ROOT, int VAL) be a function whi...read more
Answered by CodingNinjas
Add your answer
Q2. Edit Distance
You are given two strings 'S' and 'T' of lengths 'N' and 'M' respectively. Find the "Edit Distance" between the strings.
Edit Distance of two strin...read more
Ans. Recursive Approach
• We will write a recursive approach.
• The base case would be if the length of the first string is 0 then we need to add all the characters of the second string to the first string hence return the length of the second string. Similarly, if the length of the second string is 0 return length of the first string.
• Now the recurrence relation is as follows:
  • If the last characters of two strings are not the same...read more
Answered by CodingNinjas
View 2 more amswers
Q3. OS Questions
Process vs thread
why we do threading, advantages of multithreading.
What is context switching?
Where do we store the process data when we do the context switching.
Memory layout of process.
What fi...read more
Add your answer
Q4. DBMS Questions
What is concurrency control is dbms.
How is synchronization done in readers and writers.
Add your answer
Q5. Technical Questions
Explain meta tags in HTML
What Is Load Balancing?
Explain the CSS “box model” and the layout components that it consists of
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Timing : 10:30 am - 11:30 am
The interview took place on google meet. The interviewer gave 1 coding question on google docs and have to write the code on google doc itself.

Q1. Count of Smaller Elements
Given an array of size 'N' return the count array such that COUNT[i] equals the number of element which are smaller than ARR[ i ] on its the right side.
For Example : A...read more
Ans. Brute force
The main idea is for every element to count the number of elements less than ARR[i] on its right using a loop.
 
Algorithm:
• Create an ‘ANSWER’ array of size ‘N’ with an initial value 0.
• Run a loop from ‘i’ = 0 to ‘N’. Inside this run another loop from ‘j’ = ‘i+1’ to ‘N’. If  ARR[i] > ARR[j] then increment the ANSWER[i].
• In the end, return the ‘ANSWER’ array.
Space Complexity: O(1)Explanation:
O(1)
&nbs...read more
Answered by CodingNinjas
View 2 more amswers
Q2. OS Questions
What is critical section.
How does mutex work.
How does semaphores work and how it is implemented.
Binary vs counting semaphores.
Difference betweek mutex and binary semaphore.
Can we replace a code...read more
Add your answer

Round duration - 15 Minutes
Round difficulty - Easy

Timing : 11:45am - 12:00 pm.
The interview took place on google meet.

Q1. Basic HR Questions
Introduce yourself.
Tell me about your family and friends.
Tell me somthing that you love to do.
What do you expect from Sprinklr.
Where do you want to see yourself from 3-4 years from now.
Ans. 
Tip 1 : Be confident while giving the answer
Tip 2 : Be honest while sharing your thoughts.
Tip 3 : Be prepared with your answers for the most asked HR interview questions.
Answered by CodingNinjas
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

1 Coding question

Q1. Meeting
Ninja is organizing a meeting in an office that starts at a time ‘0’ and will end at a time ‘LAST’. There are ‘N’ presentations that are going to take place in that meeting whose start and end time...read more
Ans. Brute Force Approach
Algorithm:
 
• The idea here is to find the maximum sum subarray of size ‘K+1’, where the array will contain empty slots.
• First, we create an array named emptySlots[], to store the time duration in which there is no presentation.
• Run a loop to traverse all presentations, and in each iteration, add START[i] - END[i-1] (which gives a free slot between the ith presentation) into the array emptySlots[].
• N...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 90 Minutes
Round difficulty - Medium

It was an online technical round. There were around 20 MCQs and two coding questions. The round had an login window of 30 minutes. One coding question was of the level leetcode medium and the other was leetcode hard.

Q1. Search in a row wise and column wise sorted matrix
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. You are given a target integer 'X'. Find t...read more
Ans. Brute Force
• Run a loop from i = 0 to N - 1, to check each row.
  • Run a loop from j = 0 to N - 1, to check each element of the row.
    • If there is a match, return {i, j}.
• If the element is not found in the entire matrix, return {-1, -1}
Space Complexity: O(1)Explanation:
O(1).
 
Since only constant extra space is required.
Time Complexity: O(n^2)Explanation:
O(N ^ 2), where ‘N’ is the number of rows or columns in the matrix.
&nb...read more
Answered by CodingNinjas
View 2 more amswers
Q2. Euler’s Totient Function
You are given an integer 'N'. Your task is to count the number of integers between 1 and 'N' both inclusive which are coprime to 'N'.
Note:
Two numbers ar...read more
Ans. Euler’s product formula
The better solution is to use Euler’s product formula which states that the total number of integers between 1 and N - 1 inclusive which are coprime to N can be found using this formula Euler Product Formula N * (1 - (1 / p1)) * (1 - (1 / p2)) *.......* (1 - (1 / pk)) where p1,p2...pk are the prime factors of N.
 
So now the problem is to find all the prime factors and use the above formula.
&n...read more
Answered by CodingNinjas
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was a technical + HR round. The interview panel consisted of two technical guys and one person from HR.

Q1. Sort Array Of Strings
You are given an array of strings 'ARRSTR[]' of size 'N' and a character 'C'. Your task is to sort the 'ARRSTR[]' according to the new alphabetical ord...read more
Ans. HashMap Approach
Approach: The idea here is to use a data structure HashMap to store each character’s order in the new alphabetical order, starting with a letter c (given in the problem). Now, start comparing the strings in the ‘ARRSTR[]’ using HashMap that has been created to define the order.
 
Suppose that we are comparing two strings of ‘ARRSTR[]’ named ‘X’ and ‘Y’. Let us assume that we have found the first diff...read more
Answered by CodingNinjas
Add your answer
Q2. DBMS Question
What are ACID Properties?
What is a foriegn key?
Some SQL Queries on JOINS
Add your answer
Q3. OOPS Questions
Explain Pillars of OOPS
Add your answer