Zopsmart Technology Software Developer Intern Interview Questions and Answers

Some Objective questions and 1 Coding Questions

Q1. Situation based questions on Coroutines
Add your answer
Q2. About Project Tech Stack Used and Questions on that
Add your answer

There were 3 questions in the online assessment.

1 - Binary Search
2 - DP
3 - Graphs

Q1. Implement a persistence stack with constant time operations
Ans. 
Implement a persistence stack with constant time operations
• Use a combination of a stack and a hashmap to achieve constant time operations for push, pop, and get operations

• Maintain a stack to store the elements and a hashmap to store the index of each element in the stack

• When pushing an element, add it to the stack and update its index in the hashmap

• When popping an element, remove it from the stack and also remove its i...read more
Answered by AI
Add your answer

Q1. Median of two sorted arrays and OOPs basics
Ans. 
Finding the median of two sorted arrays and discussing OOPs basics
• To find the median of two sorted arrays, merge the arrays and then calculate the median

• OOPs basics include concepts like encapsulation, inheritance, polymorphism, and abstraction

• Example: Median of [1, 3] and [2] is 2.0
Answered by AI
Add your answer

Round duration - 3 Hours
Round difficulty - Hard

3 Coding questions ( 1 medium graph dfs based question , 2 hard level prefix array question ans 3 was a hard question which I don't remember)

2 Database question ( It mostly includes joining 2-3 tables and then you would be able to solve it)

Q1. Find Number Of Islands
You are given a 2-dimensional array/list having N rows and M columns, which is filled with ones(1) and zeroes(0). 1 signifies land, and 0 signifies water.
A cell is said to be conn...read more
Ans. Flood Fill Algorithm
We can use the flood fill algorithm to check for all connected 1s.
 
• We create two arrays, dx, and dy, in which we store the unit vectors for all eight directions. Thus, when we are at a given cell, we can easily check for all its adjacent cells by simply looping over the two arrays, adding their values to the current position, and checking for this new position recursively.
• We will also create a ...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Maximum Product Subarray
You are given an array “arr'' of integers. Your task is to find the contiguous subarray within the array which has the largest product of its elements. You have to report t...read more
Ans. Brute-force
Steps:
1. Create an ans variable and initialize it to INT_MIN.
2. Run a loop i = 0 to N and do:
   • Run a loop j = i to N and do:
     • Create a variable, say currentProduct and initialize it to 1.
     • Run a loop k = i to j and do:
       • currentProduct = currentProduct * arr[k]
       • Store the maximum of ans and the currentProduct in the ans variable.
3. Finally, return the ans variable.
Space Complexity: O(1)Explanation:
O(1)
 
Constant space is u...read more
Answered by CodingNinjas
View 2 more amswers
Q3. DBMS Question
There were 3-4 models given and we had to join those models to get to the result.
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

These rounds depends on the type of interviewer.
My friends were asked questions from DSA but from me they asked a lot of questions on Node.JS and React.

Q1. Technical Questions
What are promises, await , all lifecycle methods of react?
What is recursion, explain your projects, explain docker
Ans. 
Tip 1 : Have good hands on development
 
Answered by CodingNinjas
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

This round depends on your interviewer.
My colleagues were asked questions from DS but my interviewer focused just on javascript.

Q1. Web Development based Questions
What are middlewares, controllers, how to design one middleware, what is jwt, reduce ,map and filter method usage and params.
What is an event looping in javascript and how do...read more
Ans. 
Tip 1 : Be focused on Development especially in Javascript
Answered by CodingNinjas
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

It was a managerial round they will test your communication and how well do you handle situations in your life

Q1. Basic HR question
What is one of the most challenging situations that you have faced in your life and how you handled it
Ans. 
Tip 1 : just be confident and communicate with them
 
Answered by CodingNinjas
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

3 DSA questions, 2 SQL questions
On the DoSelect platform, which was good

Q1. Matrix Chain Multiplication
You are given ‘N’ 2-D matrices and an array/list “ARR” of length ‘N + 1’ where the first ‘N’ integers denote the number of rows in the Matrices and the last element denotes the ...read more
Ans. 
It was a straightforward application of the matrix multiplication approach of DP
Answered by CodingNinjas
View 3 more amswers
Q2. Linear Probing
‘Hashing’ is a technique in which a large non-negative integer is mapped with a smaller non-negative integer using a function called ‘hash function’. Hash Table is the table in which we stor...read more
Ans. Linear Probing
The approach is pretty simple. We just need to find the mapping index and if it is occupied, we need to search for the next available index.
 
The algorithm for the same is as follows:
• Create an array HASH_TABLE of size N.
• Initialise every value of HASH_TABLE as -1.
• Loop for each KEY:
  • Initialize HASH = KEY % N
  • If HASH_TABLE[ HASH ] is already occupied, we perform:
    • while(HASH_TABLE[ HASH ] != -1):
      • HASH = ( HAS...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 60 minutes
Round difficulty - Easy

Started off with introductions and projects related questions.
Basic javascript and CSS property-related questions.
An easy DSA question

Q1. Two sum
You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.
Note:
We cannot use t...read more
Ans. Hashing Solution
• We can store the frequency of every element in the array in a hashmap.
• We will loop over every index i, and check the frequency of (Target - ARR[i]) is the hashmap:
  • If (Target - ARR[i]) is equal to ARR[i], we will check if frequency of ARR[i] . If it is greater than 1 then we will decrease the frequency of ARR[i] by 2 and add a pair (ARR[i] , ARR[i]) to our answer.
  • Else, if the frequency of ARR[i] and Targ...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 45 minutes
Round difficulty - Easy

Introduction and two easy to medium DSA questions

Q1. Queue Using Two Stacks
You will be given ‘Q’ queries. You need to implement a queue using two stacks according to those queries. Each query will belong to one of these three types:
1 ‘X’: Enqueue element ...read more
Ans. Making the Enqueue operation costly
In this approach, we make sure that the oldest element added to the queue stays at the top of the stack, the second oldest below it and so on. To achieve this, we will need two stacks. 
 
First stack('STK1') is the main stack being used to store the data, while the second stack('STK2') is to assist and store data temporarily during various operations.
 
Following steps will...read more
Answered by CodingNinjas
View 1 more amswer
Q2.  Roman Numeral To Integer
Given a string that represents a roman number. Convert the roman number to an integer and return it.
Roman numerals are represented by seven different symbols: I, V, X, L, C, D,...read more
Ans. Recursive Approach
The key idea is to follow the rules of roman numbers which are as follows:
 
• The roman digits I, X and C are repeated up to three times in succession to form the numbers.
• When a digit of lower value is written to the right or after a digit of higher value, the values of all the digits are added.
• When a digit of lower value is written to the left or before a digit of higher value, then the value of th...read more
Answered by CodingNinjas
View 2 more amswers