Zopsmart Technology Software Developer Intern Interview Questions and Answers

A 90-minute coding test on HackerRank, which includes one medium, one easy, and one hard question.

Q1. What is the index of the first occurrence where a pattern string matches with a text string?
Add your answer
Q2. Given a string, how can we find the minimum length substring whose sum is greater than or equal to a specified target?
Add your answer

There are 3 questions moderate one with topics like dp ( edit distance variant ), dequeue and hashing question. I cleared the test and move forward to interview round 1

Q1. Write code for Topological sort?
Ans. 
Topological sort is a linear ordering of vertices in a directed acyclic graph.
• Use Depth First Search (DFS) to visit each vertex and add it to the result list after visiting all its neighbors.

• Maintain a visited set to keep track of visited vertices and a result list to store the sorted order.

• If a cycle is detected during DFS, the graph is not a DAG and topological sort is not possible.
Answered by AI
Add your answer
Q2. A implementation Based question of a data structure on merging square with many constraints.
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

It consisted of 17 MCQ based on networking and 3 coding questions. Among those one coding question was on practical implementation.

Q1. 
Recycling Pens Problem Statement
Imagine you have a certain number of empty pens, and some money in your pocket. For each pen, you can choose to either recycle it for a reward or buy a refill to make it u...read more
Ans. 
Given empty pens, money, and costs, maximize usable pens by recycling and buying refills.
• Calculate total money after recycling pens

• Determine number of refills that can be bought with the money

• Combine refills with remaining pens to maximize usable pens
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

It was around 5-6 p.m. The interviewer was very easy to talk to. They went straight to the questions and asked me if I had any doubts in the end.

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 - 120 Minutes
Round difficulty - Medium

Q1. 
Inorder Traversal of Binary Tree
You are provided with a Binary Tree composed of 'N' nodes, each holding integer values. Your task is to compute the Inorder traversal of this binary tree.
Example:
For t...read more
Ans. 
The task is to find the in-order traversal of a given binary tree.
• Implement a recursive function to perform in-order traversal of the binary tree

• Start from the left subtree, then visit the root node, and finally visit the right subtree

• Use an array to store the values of the nodes in the in-order traversal
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

Interview on google meet

Q1. Given two tables, how would you return an inner join on a common column (key)?
Ans. 
The inner join operation combines rows from two tables based on a common column (key).
• Use the JOIN keyword in the SQL query to perform an inner join.

• Specify the common column (key) in the ON clause of the join.

• The result will contain only the matching rows from both tables.
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

Q1. 
Search in a Row-wise and Column-wise Sorted Matrix Problem Statement
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...read more
Ans. 
Given a sorted matrix, find the position of a target integer in the matrix.
• Iterate through each row and column of the matrix

• Compare the target integer with the current element

• If the target integer is found, return the position

• If the target integer is not found, return {-1, -1}
Answered by AI
Add your answer