Zopsmart Technology Testing Interview Questions and Answers

Round duration - 180 minutes
Round difficulty - Hard

The test link had 3 days expiry so I could attempt test anytime. It was conducted on doselect.com

Q1. 
Equilibrium Indices in a Sequence
You are given an array/list named 'SEQUENCE', which consists of 'N' integers. The task is to identify all equilibrium indices in this sequence.
Explanation:
An equilibr...read more
Ans. 
The task is to find the equilibrium indices of a given sequence, where the sum of elements at lower indices is equal to the sum of elements at higher indices.
• Iterate through the sequence and calculate the total sum of all elements

• Initialize a left sum and right sum as 0

• For each index, update the left sum and right sum and check if they are equal

• If they are equal, add the index to the equilibrium indices

• Return the equil
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Video interview round wherein I was asked to wrote code for the problem statements given by the interviewer. The problems were mainly focused on advanced JS concepts like asynchonous progamming, timers, closures, and data structure problems around arrays, sets, linked list etc.

Q1. 
Rearrange Linked List Problem Statement
Given a singly linked list in the form 'L1' -> 'L2' -> 'L3' -> ... 'Ln', your task is to rearrange the nodes to the form 'L1' -> 'Ln' -> 'L2' -> '...read more
Ans. 
The task is to rearrange the nodes of a singly linked list in a specific order without altering the data of the nodes.
• Iterate through the linked list to find the middle node using the slow and fast pointer technique.

• Reverse the second half of the linked list.

• Merge the first and reversed second half of the linked list alternatively to get the desired order.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was the last round with HR wherein they judged cultural fit and there was discussion on things like my expectations v/s their expectations etc.

Round duration - 30 minutes
Round difficulty - Easy

This round mainly consisted of some questions on advanced JS topics like Execution Context, Callback queue, Micro task queue, Promises, etc.

Round duration - 60 minutes
Round difficulty - Medium

This round was more technical compared to the previous one. The interviewer was a senior developer. If questions were not answered, answers would be given/explained.

Q1. What are some aggregate operators in MongoDB?
Ans. 
Aggregate operators in MongoDB are used for data aggregation and manipulation.
• Some aggregate operators in MongoDB include $sum, $avg, $min, $max, $push, $addToSet, $first, $last, $project, $match, $group, $sort, $limit, $skip.

• Example: db.collection.aggregate([{$group: {_id: '$field', total: {$sum: '$value'}}}])
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This round was mainly to assess my experience level, roles, and responsibilities from my previous company. Salary negotiations also happened here.

Q1. JavaScript based, reduce, map, Database indexing
Add your answer

Medium to hard questions based on arrays, dp

Q1. Quick sort algorithm
Ans. 
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
• Divides array into smaller sub-arrays based on a pivot element

• Recursively sorts sub-arrays

• Combines sorted sub-arrays to get final sorted array

• Time complexity: O(n log n) on average, O(n^2) worst case

• Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Answered by AI
Add your answer
Q2. Modified rotate a matrix
Ans. 
Rotate a matrix by 90 degrees in place
• Transpose the matrix

• Reverse each row of the transposed matrix
Answered by AI
Add your answer

Q1. DSA problems on linked list, OOPs in depth programming, design pattens in Java. Some theoretical knowledge on OOPs and design patterns
Add your answer

Q1. Questions were related to tree traversal (level-order) and strings (anagram)
Add your answer

Two coding question
1st question moderate
2nd Difficult
All test cases passed for 1st question
Partial test Cases passed for 2nd question

Q1. Mid-level tree question.
Add your answer

Q1. LLD question was asked
Add your answer