Vivo Performance Tester Interview Questions and Answers for Experienced

1 hour - Trees, Array, Hashmap, DP, CP etc

Q1. Project discussion
Add your answer

Question was related to dynamic programming. There was only one question and I had solve it within 4 hours. There were 50 test cases. All test cases must pass.

Q1. Basic Java questions and some behavioural questions.
Add your answer

Q1. Behavioural questions.
Add your answer

Q1. Can you tell me about yourself?
Ans. 
I am a Senior Engineer with 10+ years of experience in designing and implementing complex systems.
• 10+ years of experience in engineering

• Specialize in designing and implementing complex systems

• Strong problem-solving skills

• Experience with various programming languages such as Java, Python, and C++
Answered by AI
Add your answer
Q2. Tell me about project
Ans. 
Designed and implemented a cloud-based data analytics platform for real-time monitoring of industrial equipment performance.
• Led a team of 5 engineers in developing the platform from scratch

• Utilized AWS services such as Lambda, S3, and DynamoDB for data storage and processing

• Implemented machine learning algorithms for predictive maintenance

• Integrated with existing industrial IoT devices for data collection

• Achieved 20% r...read more
Answered by AI
Add your answer

Q1. Salary negotiations
Add your answer

It was 1 coding question with 10 test cases. They asked a question based on binary search. I got 3 hrs to clear that test. I went in as a campus fresher. For lateral joinees, it is a much more difficult question that you have to clear in 4hrs.

Q1. What's the best way to find majority element in an array?
Ans. 
The best way to find the majority element in an array is by using the Boyer-Moore Voting Algorithm.
• Initialize a candidate variable and a count variable.

• Iterate through the array and for each element:

• - If the count is 0, set the current element as the candidate.

• - If the current element is the same as the candidate, increment the count.

• - Otherwise, decrement the count.

• After the iteration, the candidate will be the ...read more
Answered by AI
Add your answer
Q2. Reverse a linked list in K groups.
Ans. 
Reverse a linked list in K groups
• Iterate through the linked list in groups of size K

• Reverse each group of nodes using a temporary pointer

• Connect the reversed groups to form the final reversed linked list
Answered by AI
Add your answer