Faircent.com Interview Questions and Answers

Q1. What is Vector? How it is different from arrays?
Ans. 
Vector is a dynamic array that can resize itself. It differs from arrays in its ability to change size during runtime.
• Vectors are implemented as dynamic arrays, whereas arrays are static.

• Vectors can resize themselves during runtime, whereas arrays have a fixed size.

• Vectors can be used to store objects of any type, whereas arrays can only store objects of a specific type.

• Vectors have built-in functions for easy manipula
Answered by AI
Add your answer
Q2. What is an abstract class?
Ans. 
An abstract class is a class that cannot be instantiated and is used as a base class for other classes.
• An abstract class can have abstract and non-abstract methods.

• Abstract methods are declared but not implemented in the abstract class.

• A non-abstract class that inherits from an abstract class must implement all abstract methods.

• An abstract class can have constructors and fields like a regular class.

• An abstract class ca...read more
Answered by AI
Add your answer

Consisted of basic dsa questions and time complexity questions

4 dsa questions to be solved in one hour

Q1. About experience and work profile
Add your answer

Q1. About salary, position and working location
Add your answer

The aptitude round consists of approx 20 q's, out of which half the q's were based on LR and aptitude and half based on computer fundamentals.

The coding test consisted of 4 q's. The selection criteria was to complete at least 3 q's.

Q1. Tell me something about yourself
Ans. 
I am a passionate software engineer with experience in developing web applications using various technologies.
• Experienced in developing web applications using HTML, CSS, JavaScript, and frameworks like React and Angular

• Proficient in backend development with Node.js and databases like MongoDB and MySQL

• Familiar with version control systems like Git and project management tools like Jira
Answered by AI
Add your answer
Q2. Questions on React.js, as i had build projects using react.js.
Add your answer

30 minutes Aptitude test

1 Hour 30 minutes on SQL screening test

Round duration - 60 minutes
Round difficulty - Easy

This was the qualification round which comprised of several MCQs and 3 coding questions.
It was held on Hackerearth from 3:00 PM to 4:00 PM.
Use of any other IDE was prohibited.

Q1. Given a problem statement and a piece of code, how would you find and correct the bug in the code?
Ans. 
To find and correct a bug in code, analyze problem statement, review code, use debugging tools, and test different scenarios.
• Understand the problem statement and expected output.

• Review the code for syntax errors, logical errors, and potential bugs.

• Use debugging tools like breakpoints, print statements, and IDE debuggers.

• Test the code with different inputs to identify the bug.

• Make necessary corrections based on the iden...read more
Answered by AI
Add your answer
Q2. 
Print Nodes at Distance K from a Given Node
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...read more
Ans. 
Given a binary tree, a target node, and an integer K, find all nodes at distance K from the target node.
• Traverse the binary tree to find the target node.

• Use BFS to traverse the tree from the target node to nodes at distance K.

• Keep track of the distance while traversing the tree.

• Return the values of nodes at distance K in any order.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM

Q1. 
Subarray Challenge: Largest Equal 0s and 1s
Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.
Input:
Input beg...read more
Ans. 
Find the length of the largest subarray with equal number of 0s and 1s in a given array.
• Iterate through the array and maintain a count of 0s and 1s encountered so far.

• Store the count difference in a hashmap with the index as the key.

• If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.

• Return the length of the longest subarray found.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.