ZS interview experience Real time questions & tips from candidates to crack your interview
Business Technology Analyst
ZS
2 rounds | 4 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 2.5 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Application process
Where: Referral
Eligibility: Above 7 CGPA
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more
Interview rounds
01
Round
Easy
Video Call
Duration45 minutes
Interview date12 Oct 2021
Coding problem2
This round consisted of an MCQ round + Problem-Solving round + a video interview round, all were elimination rounds.
The MCQ round contained problems to test problem-solving skills, data interpretation, and aptitude.
If we clear the MCQ round then the problem-solving round is unlocked immediately. This round contained questions that tested the candidate's problem-solving abilities and how he reaches the optimal solutions to that problem.
If we clear this round then the video interview round is unlocked.
Video interview contained situation based questions which we were given 10 seconds to read and then answer them on camera for more than a minute.
1. Kevin And His Cards
Easy
20m average time
80% success
0/40
Asked in companies
Kevin has two sorted packs of cards. The first pack has N cards and the second one has M cards. Every card has an integer written on it. Now, you have to tell two things. First, how many different types of cards does Kevin have with both packs(union). Second, how many types both the packs have in common(intersection).
Note :
Two cards are said to be of different types if they have different numbers written on them.
Problem approach
Kevin has two sorted packs of cards. The first pack has N cards and the second one has M cards. Every card has an integer written on it. Now, you have to tell two things. First, how many different types of cards does Kevin have with both packs(union). Second, how many types both the packs have in common(intersection).
2. Allocate Books
Hard
0/120
Asked in companies
You are the Librarian of the Ninja library. There are ‘N’ books available in the library and ‘B’ ninjas want to read the books. You know the number of pages in each book and you have to allocate the books to the ‘B’ ninjas in such a way that the maximum number of pages allocated to a ninja is minimum.
Note
A book will be allocated to exactly one ninja.
At least one book has to be allocated to a ninja.
Allotment of the books should be done in a contiguous manner. For example, a ninja can not be allocated book 2 and book 4, skipping book 3.
The task is to return the minimum of the maximum number of pages allocated to a ninja.
Problem approach
Given an array ‘arr’ of integer numbers . where ‘arr[i]’ represents the number of pages in the ‘i-th’ book. There are ‘m’ number of students and the task is to allocate all the books to their students. Allocate books in such a way that:
1. Each student gets at least one book.
2. Each book should be allocated to a student.
3. Book allocation should be in a contiguous manner.
You have to allocate the book to ‘m’ students such that the maximum number of pages assigned to a student is minimum.
Example:
Let’s consider ‘n=4’ (number of books ) and ‘m=2’ (number of students).
‘arr = { 10, 20, 30, 40 }’.
02
Round
Easy
Video Call
Duration45 minutes
Interview date12 Oct 2021
Coding problem2
1. Reverse Linked List
Moderate
15m average time
85% success
0/80
Asked in companies
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
Problem approach
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For Example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
2. Sort 0 1 2
Easy
22m average time
0/40
Asked in companies
You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.
Note :
Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.
Problem approach
You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
Business Technology Analyst
3 rounds | 3 problems
Interviewed by ZS
Selected 
2001 views
1 comments
0 upvotes
Business Technology Analyst
1 rounds | 2 problems
Interviewed by ZS
Rejected
1174 views
0 comments
0 upvotes
Business Technology Analyst
3 rounds | 4 problems
Interviewed by ZS
Selected 923 views
0 comments
0 upvotes
Business Technology Analyst
3 rounds | 7 problems
Interviewed by ZS
Selected 1012 views
0 comments
0 upvotes