Zopsmart Technology Senior Software Engineer Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Easy

Round duration - 50 minutes
Round difficulty - Easy

Round duration - 60 minutes
Round difficulty - Easy

At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.

Round duration - 40 minutes
Round difficulty - Easy

The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me some Com­puter Sci­ence‍ fundamentals in this round as well as some behavioural questions.

Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
Ans. 
Implement a Trie data structure with insert and search functions.
• Create a TrieNode class with children and isEndOfWord attributes.

• Implement insert function to add words by iterating through characters.

• Implement search function to check if a word exists by traversing the Trie.

• Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

 Around 65-70 people sat for the test. 15 people were shortlisted. It consisted of the following to be done in 90 minutes.

- 28 MCQs based on core CS 

- 2 Coding questions – everyone had different and random questions. Most questions were custom logic based (easy level) including some standard questions – LCS, LIS, topological sort.

Round duration - 60 minutes
Round difficulty - Easy

Interviewer was very friendly. It started with the standard – tell me about yourself / introduce yourself type of question. Then he proceeded and asked two coding questions

Q1. 
Remove Duplicates from a Sorted Linked List
Your friend has homework to complete. Help him by removing duplicates from a sorted linked list.
You are given the 'Head' of a sorted linked list. Modify the l...read more
Ans. 
Remove duplicates from a sorted linked list without adjacent duplicates.
• Traverse the linked list while comparing current and next nodes.

• If they are equal, skip the next node by updating the current node's next pointer.

• Repeat until the end of the list is reached.
Answered by AI
Add your answer
Q2. 
Course Schedule Problem Statement
You are enrolled as a student and must complete N courses, numbered from 1 to N, to earn your degree.
Some courses have prerequisites, which means that to take course i,...read more
Ans. 
Check if it is feasible to complete all courses with prerequisites.
• Create a graph representing the prerequisites with courses as nodes and edges as prerequisites.

• Perform a topological sort on the graph to check if there is a cycle (if there is, then it's not feasible to complete all courses).

• If there is no cycle, then it is feasible to complete all courses.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round had only 1 question. The interviewer introduced himself. And he advised me to clearly understand the problem before proceeding.

Q1. 
LCA of Binary Tree Problem Statement
You are given a binary tree of distinct integers, along with two nodes, ‘X’ and ‘Y’. Your task is to determine the Lowest Common Ancestor (LCA) of ‘X’ and ‘Y’.
The LC...read more
Ans. 
Find the Lowest Common Ancestor of two nodes in a binary tree.
• Traverse the binary tree to find the paths from the root to nodes X and Y.

• Compare the paths to find the last common node, which is the Lowest Common Ancestor.

• Implement a recursive function to efficiently find the LCA.

• Handle cases where one node is an ancestor of the other.

• Consider edge cases like when X or Y is the root node.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Pretty Good Round. Fast Paced. We covered a lot of ground.

Q1. 
Binary Search Tree Iterator Problem Statement
Design and implement a class BSTIterator to perform an in-order traversal over a Binary Search Tree (BST). Your implementation should include the following me...read more
Ans. 
Design and implement a class BSTIterator to perform in-order traversal over a Binary Search Tree (BST).
• Implement a parameterized constructor to initialize the iterator with the root of the BST.

• Implement a method 'next()' to return the next smallest element in in-order traversal.

• Implement a method 'hasNext()' to check if there exists a next smallest element in traversal.

• Ensure the output is the in-order traversal of the
Answered by AI
Add your answer
Q2. 
Maximum Consecutive Ones Problem Statement
Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...read more
Ans. 
Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.
• Iterate through the array and keep track of the current window of 1's and zeroes.

• Use a sliding window approach to find the maximum length of consecutive 1's by flipping at most K zeroes.

• Update the window based on the number of zeroes flipped and keep track of the maximum length found so far.

• Return the maximum length ...read more
Answered by AI
Add your answer
Q3. 
BFS in Graph Problem Statement
You are given an undirected and disconnected graph G(V, E) having V vertices numbered from 0 to V-1 and E edges. Your task is to print its BFS traversal starting from the 0t...read more
Ans. 
BFS traversal of an undirected and disconnected graph starting from vertex 0.
• Start BFS traversal from vertex 0 and visit all connected nodes in sorted order.

• Use a queue to keep track of nodes to visit next.

• Keep a visited array to avoid revisiting nodes.

• Print the BFS traversal path as the nodes are visited.

• Example: For input V=5, E=4 and edges 0-1, 0-2, 1-3, 2-4, the BFS traversal will be [0, 1, 2, 3, 4].
Answered by AI
Add your answer
Q4. 
Dijkstra's Shortest Path Problem Statement
Given an undirected graph with V vertices (labeled 0, 1, ..., V-1) and E edges, each edge connects two nodes X and Y with a specified weight representing the dis...read more
Ans. 
Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in an undirected graph.
• Implement Dijkstra's algorithm to find the shortest path distance from node 0 to all other nodes in the graph.

• Use a priority queue to efficiently select the next node with the shortest distance.

• Initialize distances to all nodes as infinity, except for the source node which is 0.

• Update distances t...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

Bar Raised Round. Definitely felt the difficulty.

Q1. 
First Non-Repeating Character Problem Statement
You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...read more
Ans. 
Identify and return the first non-repeating character in a string, or the first character if all characters repeat.
• Iterate through the string to count the frequency of each character

• Iterate through the string again to find the first character with frequency 1

• If no such character is found, return the first character of the string
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

Q1. How can you check if two strings are anagrams of each other?
Ans. 
Check if two strings are anagrams by comparing the sorted versions of the strings.
• Sort both strings and compare if they are equal.

• Use a hashmap to store the frequency of characters in each string and compare the maps.

• Ignore spaces and punctuation when comparing the strings.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

Q1. 
Detect Cycle in a Directed Graph
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...read more
Ans. 
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
• Use DFS to traverse the graph and detect back edges indicating a cycle.

• Maintain a visited array to keep track of visited nodes during traversal.

• If a node is visited again during traversal and it is not the parent node, then a cycle exists.

• Return true if a cycle is detected, false otherwise.
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

Q1. 
Next Smallest Palindrome Problem Statement
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
Explanation:
You are given a number in string format, a...read more
Ans. 
Find the next smallest palindrome greater than a given number represented as a string.
• Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

• Handle cases where the number is a palindrome or has all digits as '9'.

• Consider both odd and even length numbers when finding the next palindrome.
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

Q1. 
Boundary Traversal of a Binary Tree
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
Input:
The first line ...read more
Ans. 
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
• Traverse the left boundary nodes in a top-down manner

• Traverse the leaf nodes from left to right

• Traverse the right boundary nodes in a bottom-up manner

• Handle cases where duplicates occur in the boundary nodes

• Implement the function without printing as printing is already managed
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This was a typical DS/Algo where I was asked to solve two questions related to Binary Trees and write the pseudo code for both of them followed by some theoretical questions related to Operating Systems.

Q1. 
K-th Largest Number in a BST
Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.
If there is no K-th la...read more
Ans. 
Find the K-th largest element in a BST.
• Perform reverse in-order traversal of the BST to find the K-th largest element.

• Keep track of the count of visited nodes to determine the K-th largest element.

• Return -1 if there is no K-th largest element in the BST.
Answered by AI
Add your answer
Q2. 
Is Height Balanced Binary Tree Problem Statement
Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:
1. The left subtree is balanced.
2. The right subtree is bala...read more
Ans. 
Determine if a given binary tree is height-balanced by checking if left and right subtrees are balanced and their height difference is at most 1.
• Check if the left subtree is balanced

• Check if the right subtree is balanced

• Calculate the height difference between the left and right subtrees

• Return 'True' if all conditions are met, otherwise return 'False'
Answered by AI
Add your answer
Q3. Can you explain the concepts of Zombie Process and Orphan Process in operating systems?
Ans. 
Zombie process is a terminated process that has completed execution but still has an entry in the process table. Orphan process is a process whose parent process has terminated.
• Zombie process is created when a child process completes execution but its parent process has not yet read its exit status.

• Zombie processes consume system resources and should be cleaned up by the parent process using wait() system call.

• Orphan p...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This was also a Data Structures and Algorithm round where I was asked to solve 3 medium to hard level problems along with their pseudo code within 60 minutes .

Q1. 
Longest Substring Without Repeating Characters Problem Statement
Given a string S of length L, determine the length of the longest substring that contains no repeating characters.
Example:
Input:
"abac...read more
Ans. 
Find the length of the longest substring without repeating characters in a given string.
• Use a sliding window approach to keep track of the longest substring without repeating characters.

• Use a hashmap to store the index of each character in the string.

• Update the start index of the window when a repeating character is found.

• Calculate the maximum length of the window as you iterate through the string.

• Return the maximum le
Answered by AI
Add your answer
Q2. 
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...read more
Ans. 
Search for integers in a rotated sorted array efficiently.
• Use binary search to efficiently search for integers in the rotated sorted array.

• Handle the rotation of the array while performing binary search.

• Return the index of the integer if found, else return -1.
Answered by AI
Add your answer
Q3. 
Count Subarrays with Sum Divisible by K
Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.
Input:
The first line of input contains an...read more
Ans. 
Count subarrays with sum divisible by K in an array.
• Iterate through the array and keep track of the prefix sum modulo K.

• Use a hashmap to store the frequency of each prefix sum modulo K.

• For each prefix sum, increment the count by the frequency of (prefix sum - K) modulo K.

• Handle the case when prefix sum itself is divisible by K.

• Return the total count of subarrays with sum divisible by K.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

In this round , I was asked to code a simple question related to BST . After that I was asked the internal implementation of a Hash Map where I was supposed to design a Hash Map using any of the Hashing Algorithms that I know . This was preety challenging for me but I got to learn so much from it.

Q1. 
Ceil Value from BST Problem Statement
Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.
The ceil of an integer is defined as the s...read more
Ans. 
Ceil value of a key in a Binary Search Tree (BST) is found by returning the smallest integer greater than or equal to the given number.
• Traverse the BST to find the closest value greater than or equal to the key.

• Compare the key with the current node value and update the ceil value accordingly.

• Recursively move to the left or right subtree based on the comparison.

• Return the ceil value once the traversal is complete.
Answered by AI
Add your answer
Q2. 
Design a Constant Time Data Structure
Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:
1. INSERT(key, value): Add or update t...read more
Ans. 
Design a constant time data structure to maintain mappings between keys and values with various operations.
• Use a hash table to achieve constant time complexity for INSERT, DELETE, SEARCH, and GET operations.

• Keep track of the number of key-value pairs for GET_SIZE operation.

• Check if the hash table is empty for IS_EMPTY operation.

• Return true or false for SEARCH operation based on key existence.

• Return the value associated...read more
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Hard

I found the online coding round of Flipkart to be quite difficult based on the constraints of the problem and their time limits. I coded the first problem quite easily but on the second and the third problem , my code could only pass a few test cases and gave TLE for most of them. Both the questions required very efficient solution and the last 5 to 10 Test Cases carried more weight than the rest so I didn't get through this round.

Q1. 
Print the Kth Digit
Given three non-negative integers N, M, and K, compute the Kth digit from the right in the number obtained from N raised to the power M (i.e., N ^ M).
Input:
The first line contains ...read more
Ans. 
The task is to find the Kth digit from the right in the number obtained from N raised to the power M.
• Iterate through the digits of N^M from right to left

• Keep track of the position of the current digit

• Return the digit at position K from the right
Answered by AI
Add your answer
Q2. 
The Skyline Problem
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...read more
Ans. 
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.
• Iterate through the buildings and create a list of critical points (x, y) where the height changes.

• Sort the critical points based on x-coordinate and process them to form the skyline.

• Merge consecutive horizontal segments of equal height into one to ensure no duplicates.

• Return the fin...read more
Answered by AI
Add your answer
Q3. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...read more
Ans. 
Identify the longest palindromic substring in a given string.
• Iterate through the string and expand around each character to find palindromes

• Keep track of the longest palindrome found

• Return the longest palindrome with the smallest start index
Answered by AI
Add your answer