Intellect Design Arena Full Stack Developer Interview Questions and Answers

Q1. Questions about Nestjs, React and AI
Add your answer
Q2. Singlet pattern of NestJS
Ans. 
Singleton pattern in NestJS ensures a class has only one instance and provides a global point of access to it.
• Use the @Injectable() decorator to mark a class as a singleton in NestJS.

• Inject the singleton class into other classes using the constructor.

• The instance of the singleton class will be shared across the application.
Answered by AI
Add your answer

It was easy to crack ill rate 2/5

It was a short coding round pretty easy

It was a long coding round i couldn't crack it

Q1. Introduce yourself
Add your answer
Q2. Tell me what you know about zoho
Add your answer

Q1. Project, Oops Concept, Java , which technology u have used ? Framework
Add your answer
Q2. Framework, Explain Long Polling ,
Ans. 
Long polling is a web technique where the client sends a request to the server and the server holds the connection open until new data is available.
• Long polling is a variation of the traditional polling technique where the client sends a request to the server and the server keeps the connection open until new data is available.

• It is often used in web applications to simulate real-time updates without the need for const...read more
Answered by AI
Add your answer
Q3. GraphQL Vs Rest
Ans. 
GraphQL is a query language for APIs that allows clients to request only the data they need, while REST is an architectural style for designing networked applications.
• GraphQL allows clients to request specific data in a single request, reducing over-fetching and under-fetching of data.

• REST uses multiple endpoints for different resources, leading to multiple requests for related data.

• GraphQL provides a strongly typed sc...read more
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Hard

Q1. 
Matrix Rank Calculation
Given a matrix ARR of dimensions N * M, your task is to determine the rank of the matrix ARR.
Explanation:
The rank of a matrix is defined as:
(a) The maximum number of linearly...read more
Ans. Row Echelon Form
Approach:
• The idea is based on converting the given input matrix ARR into row echelon form.
• Since we know that the rank of the matrix can not be greater than min(N, M). So we will check if N > M then we will transpose the input matrix ARR since we are using row echelon form so the matrix has to be transformed in such a way that in each row all the elements to the left of the diagonal element must be ze...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This is an elimination round. The interviewer will ask some technical questions and ask to solve some coding questions.
The interview was on Microsoft teams and coding was on codility.

Q1. 
Check Permutation Problem Statement
Determine if two given strings, 'str1' and 'str2', are permutations of each other.
Explanation:
Two strings are permutations of each other if one string's characters ...read more
Ans. Frequency Array Approach
• The first and the foremost condition for two strings to be the permutations of each other is that the frequency of each element in both of them should be the same.
• It can be proven by a very simple argument that we are only rearranging the letters, and not adding or deleting any character.
• So we allocate an array of size 256 (that is the number of distinct ASCIIacharactersterst to store the freque...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

Interviewers asked some questions regarding System design and then asked me to perform the task

Q1. Design a vending machine.
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

There were 2 interviewers. This round was basically Distributed systems.

Q1. 
Alternating Largest Problem Statement
Given a list of numbers, rearrange them such that every second element is greater than its adjacent elements. Implement a function to achieve this rearrangement.
Inp...read more
Ans. Brute forceSpace Complexity: O(1)Explanation: Time Complexity: O(n)Explanation:
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard