Zensar Technologies Software Developer Intern Interview Questions and Answers

Round duration - 120 minutes
Round difficulty - Medium

It was in the morning. It had basic questions and 2 programming questions(1 string and 1 Data Structure)

Q1. 
Character Pattern Problem Statement
Generate a pattern based on the input number of rows N. Each row i should start with the i-th letter of the alphabet, and the number of letters in the row should match ...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered Anonymously
Add your answer
Q2. 
Stack using Two Queues Problem Statement
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Explanation:
...read more
Ans. Approach 1
• This method ensures that every new element entered in the queue ‘q1’ is always at the front.
• Hence, during pop operation, we just dequeue from ‘q1’.
• For this, we need another queue ‘q2., which is used to keep every new element to the front of ‘q1’.
• During push operation :
  • Enqueue new element ‘x’ to queue ‘q2’.
  • One by one, dequeue everything from ‘q1’ and enqueue to ‘q2’.
  • Swap the names of ‘q1’ and ‘q2’.
• During pop o...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

My interviewer asked me about my projects and the concepts involved in making it. Then he asked me to solve a string problem which was not very difficult followed by basic questions on array and it's properties. He also asked HTML tags.

Q1. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. Optimal Solution
• Traverse the string and swap the first character with the last character, the second character with the second last character and so on.
• Basically, you need to swap the i-th character with the (N-i-1)-th character where N is the length of the string and 0-based indexing is considered.
Space Complexity: O(1)Explanation:
O(1).
 
In the worst case, only constant extra space is required.
Time Complexity: O(...read more
Answered Anonymously
Add your answer

Round duration - 150 minutes
Round difficulty - Easy

This round for Sapient was based on it's core values and how I've implemented these once or more in life. It mostly involved discussion around my leadership, team player, problem solving and innovative skills as a part of the clubs in college. Also, what are my expectations from Sapient and what I bring to them

It was a 2hr test. It had two sections. 1)Quantitative aptitude and verbal ability and 2) Technical aptitude.

Q1. It was for 45 min. Asked some OOPs concepts, CN fundamentals. Questions were asked on arrays and linked lists. also on OS
Add your answer

Q1. It was for 5 min. Asked on why I wanted to join Optum
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This round contains 40 mcq questions 15 dsa and 25 aptitude.
then there was 5 coding questions.

Q1. 
Check If Binary Representation of a Number is Palindrome
Given an integer N, determine if its binary representation is a palindrome.
Input:
The first line contains a single integer ‘T’ representing the ...read more
Ans. 
Check if binary conversion of given number is palindrome or not. Ex: 6 (0110) is palindrome.
I used a recursive function for binary conversion and then check for palindrome using a loop. Refrain from using inbuilt functions as they wanna check your logic. O(n) time complexity.
Answered Anonymously
Add your answer
Q2. 
Word Break Problem Statement
You are given a list of N strings called A. Your task is to determine whether you can form a given target string by combining one or more strings from A.
The strings from A c...read more
Ans. 
 One Sentence (string) is given. find out the words, that has length even and greater than equal to 4 (e.g. 4,6,8.. etc.) and separate them with space.
e.g. Given String : “abcd abc abcde abcdef”
Output: “ab cd abc abcde abc def”
I allocated a new string dynamically, and used two for loops to copy one string to another, adding a space at the middle of the word where word length was >=4 and even. O(n^2) time comple
Answered Anonymously
Add your answer

Round duration - 25 minutes
Round difficulty - Easy

Technical Round

Q1. 
Sort 0 and 1 Problem Statement
Given an integer array ARR of size N containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using an...read more
Ans. 
Then he made it complex by saying that if there are numbers from 0 to k in an array of size n then how will you sort them in O(n), I told him the count sort, he agreed with it and then asked me to quickly write down the code, I wrote it down, there was a silly mistake which he pointed out and said that it’s good and then moved on to next problem. He saw my code for fourth largest in an array, I did it using heap and ti...read more
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

he interviews were conducted simultaneously for all on BlueJeans along with a code sharing website. After the initial set up and introduction, a set of 2 questions from DSA were asked from all candidates. The results were announced the same day.

Q1. 
DFS Traversal Problem Statement
Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...read more
Add your answer
Q2. 
Median of Two Sorted Arrays
Given two sorted arrays A and B of sizes N and M, find the median of the merged array formed by combining arrays A and B. If the total number of elements, N + M, is even, the m...read more
Add your answer

Round duration - 120 mintues
Round difficulty - Medium

Aptitude round was in afternoon around 3 pm and every person who has given aptitude round was also given an other chance which was coding round. There was a time gap of 1 hr between two test. both of these went online. Environment was good without any lag. Webcam was on throughout the test. There were 3 coding questions, of which 2 were medium and one was easy. I attempted all of them.

Q1. 
String Rotation Problem Statement
You are given a string named str and an integer D. Your task is to perform both left (anticlockwise) and right (clockwise) rotations on the given string by D units, start...read more
Add your answer
Q2. 
Height of Binary Tree
You are provided with the Inorder and Level Order traversals of a Binary Tree composed of integers. Your goal is to determine the height of this Binary Tree without actually construc...read more
Add your answer
Q3. 
Common Elements Problem Statement
Identify and output the common strings present in both given arrays of lowercase alphabets for each test case.
Input:
The first line contains an integer 'T' representin...read more
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

This round was at 12 pm. Interviewer and I greeted each other and then he asked me to explain all the questions I had done during test. He shared screen with my report of test which was having the solutions I typed during coding rounds. It took around 20 minutes to explain all three questions. Interviewer was happy with my explanation. Then he had asked me one coding question and various questions based on my project. I answered him all with a smile.

Q1. 
Maximum Subarray Sum Problem Statement
Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Explanation...read more
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was in afternoon. HR called to me to fix a meeting on Microsoft teams. He was very polite with experience of corporate environment.