Wipro Data Analyst Interview Questions, Process, and Tips

Round duration - 90 minutes
Round difficulty - Medium

There were around 30 questions ranging from DBMS, OOPS + 2 coding questions to be solved in 90 minutes. MCQ's were easy to solve as they had been covered in my college's curriculum. It was a webcam monitored test.

Q1. 
Chocolate Distribution Problem
You are given an array/list CHOCOLATES of size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'...read more
Ans. 
Distribute chocolates among students to minimize the difference between the largest and smallest number of chocolates.
• Sort the array of chocolates packets in ascending order.

• Iterate through the array and find the minimum difference between the chocolates in packets for each possible distribution to students.

• Return the minimum difference as the result.
Answered by AI
View 2 more answers
Q2. 
Ninja and Substrings Problem Statement
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...read more
Ans. 
Find all unique contiguous substrings of size two from a given string.
• Iterate through the string and extract substrings of size two

• Use a set to store unique substrings

• Return the set as an array of strings
Answered by AI
View 2 more answers

Round duration - 50 minutes
Round difficulty - Medium

This was a technical round. I got the call after getting shortlisted in the Aptitude + Coding test. This round lasted for 50 minutes and started around 12 PM. The meeting was conducted on a Microsoft Teams call. 
I was asked questions based on my resume and my projects for the most part of the interview. Towards the end of the interview, I was asked 1 Problem based on Prefix arrays. Initially I presented the brute force O(N*2) solution followed by the optimal O(N) solution. This round went good for me.

Q1. 
Time to Burn Tree Problem
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...read more
Ans. 
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
• Traverse the tree to find the start node and calculate the time for fire to spread to all nodes.

• Use a queue to keep track of nodes to be burned next.

• Increment the time for each level of nodes burned.

• Return the total time taken to burn the entire tree.
Answered by AI
View 1 more answer

Q1. About c programming basics
Add your answer
Q2. Oops concepts,basics of c
Add your answer

Polindrome or not ,null pointers

Q1. Mainly about job description
Add your answer

To check your aptitude test in written form

To check your communication skills

Q1. Tell me about yourself
Add your answer
Q2. Tell me about project details (college)
Add your answer
Q3. Strength weakness
Add your answer
Q4. How good are your communication skills
Add your answer
Q5. Most questions to test strength of communication
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Tell me something about you apart from the resume
Add your answer
Q3. Give reasons why should we hire you
Add your answer
Q4. Where do you see yourself in case we are hiring
Add your answer
Q5. How long are you planning to stay in this company
Add your answer
Q6. What do you think/know about wipro
Add your answer
Q7. Can you handle pressure
Ans. 
Yes, I can handle pressure well.
• I prioritize tasks and manage my time effectively

• I remain calm and focused under pressure

• I seek help or guidance when needed

• I have experience working under tight deadlines, such as during quarterly reports
Answered by AI
Add your answer
Q8. Mostly situational/behavioral questions
Add your answer