Zopsmart Technology Interview Questions, Process, and Tips

Easy to medium level coding interview round.

Q1. Interview based on technical skills, computer science concepts and projects etc.
Add your answer

Linked lists, arrays, strings

Q1. Oops, dsa, git, projects
Add your answer

Q1. The first round was a detailed discussion on one of my previous projects(almost 35 minutes, went to maximum possible depth) and one DSA question. Please prepare your resume projects very well.
Add your answer
Q2. The question was a stack bases leetcode medium question.
Add your answer

Q1. This was the final round. It again a follow up of the first one. Started with a project discussion(did not go that much of depth as first one) . Again one DSA question was there to solve(they make you writ...read more
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

Round 2 was a technical interview conducted on Google meet. The interviewer was so much friendly.

Introduce yourself.
Explain your project (as it was mentioned in my resume).
Asked a few questions about my projects, I answered all of them, and he appreciated that.
Questions on os cn dbms and oops followed by 2 data structures problem
Also questions about javascript, typescript, css and html.

Q1. 
Find Indices for Local Minima and Maxima
Given an integer array arr of size N, your task is to determine all indices of local minima and local maxima within the array. Return these indices in a 2-D list, ...read more
Ans. 
The task is to find and return the indices of local minima and local maxima in the given array.
• Iterate through the array and compare each element with its neighbors to determine if it is a local minima or maxima.

• Consider corner elements separately by comparing them with only one neighbor.

• Store the indices of local minima and maxima in separate lists.

• If there are no local minima or maxima, return -1 as the only row elem
Answered by AI
Add your answer
Q2. 
Rotational Equivalence of Strings Problem Statement
Given two strings 'P' and 'Q' of equal length, determine if string 'P' can be transformed into string 'Q' by cyclically rotating it to the right any num...read more
Ans. 
The task is to check if one string can be converted into another string by cyclically rotating it to the right any number of times.
• Check if the lengths of the two strings are equal. If not, return 0.

• Concatenate the first string with itself and check if the second string is a substring of the concatenated string.

• If the second string is a substring, return 1. Otherwise, return 0.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

I was asked to explain my project and the difficulties I faced while implementing it followed by 2 coding questions.
Interviewer was very senior this time but helped me a lot during the process. Asked some sql queries like to find count of the books by their category had to use group by.

Q1. 
Minimum Jumps Problem Statement
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...read more
Ans. 
This question asks for the minimum number of trampoline jumps a person needs to make in order to reach the last shop in a mall.
• The shops in the mall are laid out in a straight line and each shop has a constant value representing the maximum distance it can be jumped to.

• The person starts at shop 0 and wants to reach the last shop, shop N-1.

• If it is impossible to reach the last shop, the function should return -1.

• The fun...read more
Answered by AI
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy

Asked me Tell me something about myself. She also described the way ZopSmart does business.

Q1. Agile scrum Technical insights
Add your answer
Q2. Team Managemnt Conflict Managemnt
Add your answer

Q1. K-Reverse a linked list. Have to code in Go lang as the role was for Go lang developer
Add your answer

Q1. Linkedlist insertion & deletion in Go
Ans. 
Linkedlist insertion & deletion in Go
• In Go, linked lists can be implemented using structs and pointers.

• Insertion involves creating a new node and updating the pointers of adjacent nodes.

• Deletion involves updating the pointers of adjacent nodes to bypass the node being deleted.

• Go's garbage collector automatically frees memory of unused nodes.
Answered by AI
Add your answer
Q2. Go lang concurrency and concurrency patterns
Add your answer

Q1. SQL vs NoSQL and when to use what
Ans. 
SQL is best for structured data, NoSQL for unstructured. Use SQL for complex queries, NoSQL for scalability and speed.
• SQL is best for structured data, NoSQL for unstructured

• Use SQL for complex queries, NoSQL for scalability and speed

• SQL is ACID compliant, NoSQL is BASE

• Examples of SQL: MySQL, Oracle, PostgreSQL

• Examples of NoSQL: MongoDB, Cassandra, Redis
Answered by AI
Add your answer
Q2. DB queries on finding the second largest element
Ans. 
Query to find the second largest element in a database table
• Use ORDER BY and LIMIT to select the second largest element

• For MySQL: SELECT column FROM table ORDER BY column DESC LIMIT 1,1

• For Oracle: SELECT column FROM (SELECT column FROM table ORDER BY column DESC) WHERE ROWNUM <= 2 MINUS SELECT column FROM (SELECT column FROM table ORDER BY column DESC) WHERE ROWNUM <= 1
Answered by AI
Add your answer
Q3. Discussion on projects mentioned in the CV
Add your answer