3 nference Full Stack Developer Interview Questions & Answers | Complete Prep Guide 2025

nference Full Stack Developer Interview Experiences

1 interview found

Full Stack Developer Interview Questions & Answers

Anonymous

posted on 20 Jan 2025

Interview experience

Good

Difficulty level

Moderate

Process Duration

Less than 2 weeks

Result

Selected

I applied via Job Portal and was interviewed before Jan 2024. There were 3 interview rounds.

Round 1 - Technical

(1 Question)

Q1. Questions on react, solving a problem on code sandbox

Add your answer

Round 2 - One-on-one

(1 Question)

Q1. Backend tech questions, few coding problems, normal difficulty

Add your answer

Round 3 - One-on-one

(1 Question)

Q1. With India head, general discussion

Add your answer

Top trending discussions

View All

Salary Discussions, Hike & Promotions

an architect

Help me choose New Regime or Old Regime for my salary revision

Hi I am working as a full stack Architect (14 yeo) and Following is my CTC. Please help me calculate in hand salary and choose New or OLD r... read more

Got a question about nference?

Ask anonymously on communities.

Interview questions from similar companies

Software Developer Interview Questions & Answers

Innoplexus

Anonymous

posted on 14 May 2017

I was interviewed before May 2016.

Interview Questionnaire

1 Question

Q1. I was asked about myself and my expectations. It was a relatively casual session.

Add your answer

Interview Preparation Tips

Round: Resume Shortlist
Experience: It was mostly based on pointers. I was lucky they checked my skills and I was shortlisted in List B

Round: Coding Aptitude
Experience: It was a python based round. I was required to solve 20 questions in 20 minutes.

Round: HR Interview
Tips: Maintain your peace of mind and keep calm. More importantly don't be greedy.

Skills: Python
College Name: IIT BHU

Software Developer Interview Questions & Answers

Practo

Anonymous

posted on 5 Apr 2022

I was interviewed before Apr 2021.

Round 1 - Coding Test

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This round had 3 coding questions of Medium to Hard level of difficulty.

Q1.

Balanced Parentheses Combinations

Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.

Explanati...

Ans.

Generate all possible combinations of balanced parentheses for a given number of pairs.

Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.

Answered by AI

Add your answer

Q2.

Trapping Rain Water Problem Statement

You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the i^th bar. Your task is to determine th...

Ans.

Calculate the total amount of rainwater that can be trapped between given elevations in an array.

Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.

Answered by AI

Add your answer

Q3.

Rotting Oranges Problem Statement

You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

0 - representing an empty cell
1 - representing a fre...

Ans.

Find the minimum time required to rot all fresh oranges adjacent to rotten oranges.

Create a queue to store the coordinates of rotten oranges and perform BFS to rot adjacent fresh oranges.
Track the time taken to rot all fresh oranges and return -1 if not all fresh oranges can be rotten.
Update the grid with the new state of oranges after each second.
Handle edge cases such as empty grid or no fresh oranges present.
Example...

Answered by AI

Add your answer

Round 2 - Face to Face

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a standard DS/Algo round where I was given 2 questions to solve under 60 minutes. I was able to come up with the optimal approach for both the questions and then at the end of the interview I was also asked the famous Die Hard Water Puzzle.

Q1.

Queue Using Stacks Implementation

Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.

Explanation:

Your task is to complete predefined functions t...

Ans.

Implement a queue using stacks following FIFO principle.

Use two stacks to simulate a queue.
For enQueue operation, push elements onto stack1.
For deQueue operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then pop from stack2.
For peek operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then return top of stack2.
For isEmpty operation, check if both stack1 and st...

Answered by AI

Add your answer

Q2.

Merge Intervals Problem Statement

You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.

Your task is to merge all overlapping intervals a...

Ans.

Merge overlapping intervals and return sorted list of merged intervals by start time.

Sort the intervals based on start time.
Iterate through intervals and merge overlapping ones.
Return the merged intervals in sorted order.

Answered by AI

Add your answer

Q3. You have a 3-liter jar and a 5-liter jar. How can you measure exactly 4 liters using these two jars?

Add your answer

Round 3 - Face to Face

(4 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 coding questions - first one related to Binary Tree and the second one was a simple question from Bit Manipulation. This was followed by some questions from OOPS.

Q1.

Binary Tree Diameter Problem Statement

You are given a Binary Tree, and you need to determine the length of the diameter of the tree.

The diameter of a binary tree is the length of the longest path betwe...

Ans.

The task is to find the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.

Traverse the tree to find the longest path between two nodes.
Keep track of the maximum diameter found during traversal.
The diameter may not necessarily pass through the root node.
Consider both left and right subtrees while calculating the diameter.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1

Answered by AI

Add your answer

Q2.

Power of 2 Problem Statement

Determine if it is possible to reorder the digits of a given integer 'N' such that the resulting number is a power of two. The leading digit must not be zero.

Input:

The fir...

Ans.

The problem involves determining if it is possible to reorder the digits of a given integer to form a power of 2.

Iterate through all possible permutations of the digits of the given integer.
Check if any of the permutations form a power of 2.
Return 1 if a valid permutation is found, else return 0.

Answered by AI

Add your answer

Q3. What are some advantages of using Object-Oriented Programming (OOP)?

Ans.

Advantages of OOP include code reusability, modularity, and easier maintenance.

Code reusability: Objects can be reused in different parts of the program, reducing redundancy.
Modularity: OOP allows for breaking down complex problems into smaller, more manageable parts.
Easier maintenance: Changes to one part of the codebase do not necessarily affect other parts, making maintenance easier.
Encapsulation: Data hiding and ab...

Answered by AI

Add your answer

Q4. What are access specifiers and what is their significance in Object-Oriented Programming?

Ans.

Access specifiers define the level of access to class members in Object-Oriented Programming.

Access specifiers include public, private, protected, and default
Public members are accessible from outside the class
Private members are only accessible within the class
Protected members are accessible within the class and its subclasses
Default access is when no access specifier is specified

Answered by AI

Add your answer

Round 4 - HR

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.

Q1. Why should we hire you?

Add your answer

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPracto interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, DBMS, OS, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Interview Questions & Answers

Practo

Anonymous

posted on 9 May 2015

Interview Questionnaire

8 Questions

Q1. Implement queue with the help of two stacks

Ans.

Queue can be implemented using two stacks by maintaining the order of elements in the stacks.

Create two stacks, let's call them stack1 and stack2
When an element is enqueued, push it to stack1
When an element is dequeued, pop all elements from stack1 and push them to stack2
Pop the top element from stack2 and return it as the dequeued element
If stack2 is empty, repeat step 3
To get the front element of the queue, peek the

Answered by AI

Add your answer

Q2. Iven a table “student” of with columns Name and Marks. You have to write a SQL query to get the 2nd highest marks from the table. Also write a query to find the nth highest marks, where n can be any number

Add your answer

Q3. What is left join. Give example. And Full outer join?

Ans.

Left join returns all records from left table and matching records from right table. Full outer join returns all records from both tables.

Left join is used to combine two tables based on a common column.
In left join, all records from the left table are returned along with matching records from the right table.
If there is no match in the right table, NULL values are returned.
Example: SELECT * FROM table1 LEFT JOIN table...

Answered by AI

Add your answer

Q4. What is magic functions and autoloading in PHP?

Ans.

Magic functions are special methods in PHP that start with __. Autoloading is a way to automatically load classes.

Magic functions are used to handle certain events in PHP, such as object creation or property access.
Autoloading allows PHP to automatically load classes when they are needed, without requiring manual includes.
Magic functions can be used in conjunction with autoloading to dynamically load classes or handle

Answered by AI

Add your answer

Q5. Given three arrays sorted in non-decreasing order, print all common elements in these arrays. Examples: ar1[] = {1, 5, 10, 20, 40, 80} ar2[] = {6, 7, 20, 80, 100} ar3[] = {3, 4, 15, 20, 30, 70, 80, 120} Ou...

Ans.

Given three sorted arrays, find common elements.

Create three pointers to traverse each array
Compare the elements at the pointers and move the pointer of the smallest element
If all pointers point to the same element, add it to the result and move all pointers
Repeat until any pointer reaches the end of its array

Answered by AI

Add your answer

Q6. A puzzle. You will be given with a 3 Litre container & a 7 Litre Container. Measure exactly 5 Litres of water

Add your answer

Q7. Asked about one of my projects I mentioned in my resume?

Add your answer

Q8. Find if a number is a power of 2 or not?

Ans.

Check if a number is a power of 2 or not.

A power of 2 has only one bit set in its binary representation.
Use bitwise AND operator to check if the number is a power of 2.
If n is a power of 2, then n & (n-1) will be 0.

Answered by AI

Add your answer

Interview Preparation Tips

Skills: Data structures, PHP, Algortihm
College Name: na
Motivation: Overall it was a very good experience. They test you from every aspect. In the End I would like to say that Practo is one of the best companies to work for.

Skills evaluated in this interview

Software Developer Interview Questions & Answers

Practo

Anonymous

posted on 9 May 2015

Interview Questionnaire

9 Questions

Q1. What is event bubbling?

Ans.

Event bubbling is the propagation of an event from the innermost child element to the outermost parent element.

Events triggered on a child element will also trigger on its parent elements
The event travels up the DOM tree until it reaches the document object
Can be stopped using event.stopPropagation()
Can be useful for event delegation

Answered by AI

Add your answer

Q2. Difference between .on(‘click’,function() and .click(function())

Ans.

The .on('click',function() is a more flexible method than .click(function())

The .on() method can handle multiple events and selectors
The .click() method can only handle one event and one selector
The .on() method can also handle dynamically added elements
The .click() method cannot handle dynamically added elements

Answered by AI

Add your answer

Q3. Write a function to check if two strings are anagram or not

Ans.

Function to check if two strings are anagram or not

Create two character arrays from the strings
Sort the arrays
Compare the sorted arrays

Answered by AI

Add your answer

Q4. Given an array of integers which can be in one of four order – i.Increasing 2.Decreasing 3.decreasing then increasing 4.increasing then decreasing .Write a function to find the type of array

Ans.

Function to determine the order of integers in an array.

Check first and last element to determine if increasing or decreasing
Check for inflection point to determine if order changes
Return order type as string

Answered by AI

Add your answer

Q5. How can you improve the performance of a site.(Only frontend)

Ans.

Optimize images, minify code, reduce HTTP requests, use caching, and lazy loading.

Optimize images using compression and appropriate file formats
Minify code to reduce file size and improve load times
Reduce HTTP requests by combining files and using sprites
Use caching to store frequently accessed data locally
Implement lazy loading to defer loading of non-critical resources

Answered by AI

Add your answer

Q6. Design database schema for a movie site.Where user can watch the movie,genre of movie,give ratings and recommended movies to user.Also Write an algorithm to show recommended movies to user

Ans.

Design a database schema for a movie site with user ratings and recommendations.

Create tables for movies, users, ratings, and recommendations
Use foreign keys to link tables
Include columns for movie genre and user watch history
Algorithm for recommendations can use user watch history and ratings to suggest similar movies

Answered by AI

Add your answer

Q7. By tossing a coin we can get either head or tail, i have a function toss() which return head or tail with equal probability

Add your answer

Q8. You have to write a function for dice which will return number from 1-6 with equal probability. constraints : you can not use random function, you can use only toss function

Ans.

Function to simulate dice roll with equal probability without using random function

Use a toss function that returns either 0 or 1 with equal probability
Call the toss function 3 times and convert the result to a binary number
If the binary number is greater than 0 and less than or equal to 6, return it
If the binary number is greater than 6, repeat the process

Answered by AI

Add your answer

Q9. Write a query to fetch duplicate email from table?

Ans.

Query to fetch duplicate email from table

Use GROUP BY and HAVING clause to filter out duplicates
SELECT email, COUNT(*) FROM table_name GROUP BY email HAVING COUNT(*) > 1;
This will return all the duplicate emails in the table

Answered by AI

Add your answer

Interview Preparation Tips

Skills: data structure, Algorithm
College Name: na
Motivation: Practo is the market leader in digital healthcare management with millions of consumers using our products to find doctors, book appointments and manage their healthcare efficiently. Practo Ray is the platform of choice for the vast majority of doctors and clinics deploying cloud based clinic management solution.I recently got an offer from Practo, here is my interview experience:

Skills evaluated in this interview

Software Developer Interview Questions & Answers

BrowserStack

Anonymous

posted on 8 Oct 2024

Interview experience

Excellent

Difficulty level

Process Duration

Result

Round 1 - Technical

(1 Question)

Q1. Implement tail f

Add your answer

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn development along with DSA

Software Developer Interview Questions & Answers

Zopsmart Technology

Anonymous

posted on 2 Aug 2024

Interview experience

Average

Difficulty level

Process Duration

Result

Round 1 - Technical

(2 Questions)

Q1. Coding question on DSA

Add your answer

Q2. Design pattern followed by basic java questions

Add your answer

Round 2 - Technical

(2 Questions)

Q1. Design patterns in java

Ans.

Design patterns in Java are reusable solutions to common problems in software design.

Design patterns help in creating flexible, maintainable, and scalable code.
Some common design patterns in Java include Singleton, Factory, Observer, and Strategy.
Each design pattern has its own purpose and can be applied in different scenarios.
Design patterns promote code reusability and help in organizing code in a structured manner.

Answered by AI

Add your answer

Q2. Database designing and java8

Add your answer

Skills evaluated in this interview

Software Developer Interview Questions & Answers

Zopsmart Technology

Anonymous

posted on 12 Sep 2024

Interview experience

Excellent

Difficulty level

Moderate

Process Duration

Less than 2 weeks

Result

Not Selected

I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.

Round 1 - Aptitude Test

Basic questions of dbms ,os

Round 2 - One-on-one

(2 Questions)

Q1. Delete middle node of linked list

Ans.

To delete the middle node of a linked list, we can iterate through the list to find the middle node and then remove it by adjusting the pointers.

Iterate through the linked list to find the middle node by using two pointers - one moving one node at a time and the other moving two nodes at a time.
Once the middle node is found, adjust the pointers to skip over the middle node and connect the nodes before and after it.
Hand...

Answered by AI

Add your answer

Q2. N queen problem

Add your answer

Interview Preparation Tips

Interview preparation tips for other job seekers - Be self-confident

Skills evaluated in this interview

Software Developer Interview Questions & Answers

Zopsmart Technology

Aakansha latiyan

posted on 14 May 2024

Interview experience

Excellent

Difficulty level

Process Duration

Result

Round 1 - Aptitude Test

Aptitude test such as profit and loss , blood relations

Round 2 - Coding Test

Questions on string and map

Round 3 - HR

(1 Question)

Q1. Questions like will you be able to work after your assigned time

Add your answer

Software Developer Interview Questions & Answers

Zopsmart Technology

Sivapriya K

posted on 9 Nov 2022

I applied via Recruitment Consulltant and was interviewed in Oct 2022. There were 4 interview rounds.

Round 1 - Aptitude Test

The aptitude test was in online mode. There were 20 mcq questions and 5 coding questions ranging from easy to hard

Round 2 - Group Discussion

After the Aptitude test, the gd was kept in offline mode ( at office ), the topic was "the pros and cons of online classes

Round 3 - Technical

(1 Question)

Q1. In the 1st technical round, basic questions regarding the languages which i have mentioned in resume was asked. I mentioned python and C in my resume and a coding problem was asked to solve and to further ...

Add your answer

Round 4 - Technical

(1 Question)

Q1. In the second technical OOPS concepts and DSA questions were asked

Add your answer

Interview Preparation Tips

Topics to prepare for Zopsmart Technology Software Developer interview:

DSA
Algorithms
Coding
resume

Interview preparation tips for other job seekers - If you pass the last technical round then you will be selected in HR round for the same.

nference Interview FAQs

How many rounds are there in nference Full Stack Developer interview?

nference interview process usually has 3 rounds. The most common rounds in the nference interview process are One-on-one Round and Technical.

How to prepare for nference Full Stack Developer interview?

Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at nference. The most common topics and skills that interviewers at nference expect are Front End, GIT, Graphics, Javascript and Kafka.

What are the top questions asked in nference Full Stack Developer interview?

Some of the top questions asked at the nference Full Stack Developer interview -

questions on react, solving a problem on code sand...read more
backend tech questions, few coding problems, normal difficu...read more
with India head, general discuss...read more

Software Engineer 86 salaries	₹0 L/yr - ₹0 L/yr
Senior Software Engineer 49 salaries	₹0 L/yr - ₹0 L/yr
Data Scientist 19 salaries	₹0 L/yr - ₹0 L/yr
Staff Engineer 11 salaries	₹0 L/yr - ₹0 L/yr
Senior Data Scientist 9 salaries	₹0 L/yr - ₹0 L/yr

nference Full Stack Developer Interview Questions and Answers

nference Full Stack Developer Interview Experiences

1 interview found

(1 Question)

(1 Question)

(1 Question)

Interview questions from similar companies

Interview Questionnaire

1 Question

Interview Preparation Tips

(3 Questions)

Balanced Parentheses Combinations

Explanati...read more

Trapping Rain Water Problem Statement

Rotting Oranges Problem Statement

(3 Questions)

Queue Using Stacks Implementation

Explanation:

Merge Intervals Problem Statement

(4 Questions)

Binary Tree Diameter Problem Statement

Power of 2 Problem Statement

Input:

(1 Question)

Interview Preparation Tips

Skills evaluated in this interview

Interview Questionnaire

8 Questions

Interview Preparation Tips

Skills evaluated in this interview

Interview Questionnaire

9 Questions

Interview Preparation Tips

Skills evaluated in this interview

(1 Question)

Interview Preparation Tips

(2 Questions)

(2 Questions)

Skills evaluated in this interview

(2 Questions)

Interview Preparation Tips

Skills evaluated in this interview

(1 Question)

(1 Question)

(1 Question)

Interview Preparation Tips

nference Interview FAQs

Recently Viewed

InsuranceDekho

Credit Bajaar

Gap

Dhruv Research

Thorogood

National Stock Exchange of India

HSCC India

Xperi

nference

Tell us how to improve this page.

nference Interviews By Designations

Interview Questions for Popular Designations

nference Full Stack Developer Interview Process

Interview Questions from Similar Companies

Fast track your campus placements

Explanati...