Snapdeal Business Analyst Interview Questions, Process, and Tips

We had an aptitude test which involved 60 questions in 15 minutes. Of course, no one can solve this fast, but it was about the hit rate / accuracy and volume. Subsequent followed with two guesstimate based rounds and final as HR round which involved asking about college projects, extra curricular experiences and so on.

Q1. Where do you see yourself in 5 years
Add your answer

Q1. How you will improve health of a marketplace
Ans. 
By analyzing data, identifying pain points, and implementing solutions to improve user experience and trust.
• Analyze user behavior and feedback to identify areas of improvement

• Implement measures to increase transparency and trust, such as user reviews and seller verification

• Provide resources and support for dispute resolution

• Encourage diversity and inclusivity in the marketplace to attract a wider range of buyers and se...read more
Answered by AI
Add your answer

Q1. How you will design new customer support system
Ans. 
I will design a customer support system that is user-friendly, efficient, and personalized.
• Conduct research to understand customer needs and preferences

• Identify common customer issues and develop a knowledge base for quick resolution

• Implement a ticketing system to track and prioritize customer inquiries

• Integrate chatbots and AI to provide 24/7 support

• Train support staff to provide personalized and empathetic service

• Col...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

In the interview I was asked few puzzles and few coding problems.
In the coding questions the interviewers did not ask me to write down the complete codes of the problems, they only asked me to suggest some suitable algorithms.

Q1. 
Count Set Bits Problem Statement
Given a positive integer N, find the total number of '1's in the binary representation of all the numbers from 1 to N.
You should return the result modulo 10⁹+7 as the co...read more
Ans. 
A simple method would be to Loop through all bits in an integer, check if a bit is set and if it is, then increment the set bit count.
Time Complexity: Θ(logn) 
Auxiliary Space: O(1)

Efficient approach would be to use Brian Kernighan’s Algorithm.
Algorithm :
1) Initialize count: = 0
 
2) If integer n is not zero
(a) Do bitwise & with (n-1) and assign the value back to n
n: = n&(n-1)
(b) Increment count by 1
(c)
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

In second round of interview I was asked some hardcore programming questions on data structures since I wrote it as my area of interest. 
I was asked some puzzles as well.

Q1. 
Merge Two Sorted Arrays Problem Statement
Given two sorted integer arrays ARR1 and ARR2 of size M and N, respectively, merge them into ARR1 as one sorted array. Assume that ARR1 has a size of M + N to hol...read more
Ans. 
A simple approach would be to create a new arrays with size as sum of the sizes of both the arrays. Copy the elements of both the arrays in the new array and sort the array. 
A space optimized approach also exists. While traversing the two sorted arrays parallelly, if we encounter the jth second array element is smaller than ith first array element, then jth element is to be included and replace some kth element in...read more
Answered Anonymously
Add your answer