Vinsinfo Associate Developer 2 Interview Questions and Answers

Q1. Oops, basic ,SQL ,ado
Add your answer

Curd operation with SQL connectivity

2 hrs duration with 2 easy level dsa questions and 15 around mcqs based on core cs concepts.

Q1. Implement stack using linked list.
Ans. 
Implementing stack using linked list
• Create a Node class with data and next pointer

• Create a Stack class with top pointer

• Implement push() method to add element to top of stack

• Implement pop() method to remove element from top of stack

• Implement peek() method to return top element without removing it
Answered by AI
Add your answer
Q2. Print first duplicate value in a string.
Ans. 
Find the first duplicate value in an array of strings.
• Create a hash table to store the frequency of each string.

• Iterate through the array and check if the string already exists in the hash table.

• If it does, return the string. If not, add it to the hash table.

• If no duplicates are found, return null or an appropriate message.
Answered by AI
Add your answer

Q1. Tell me something about yourself?
Add your answer
Q2. What is you strength and weakness
Add your answer
Q3. Why do you want to work with our organisation
Add your answer
Q4. What make’s you different form others
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

Link was active for 24 hours, I took the test at night.
Difficulty was medium.
There were some MCQs on Springboot/Java along with 2 DSA questions.

Q1. 
Zigzag Binary Tree Traversal Problem
Given a binary tree, compute the zigzag level order traversal of the node values in the tree. The zigzag traversal requires traversing levels from left to right, then ...read more
Ans. 
Applied BFS for level order traversal.
The core logic is how to append the current level nodes in the resultList.
If currLevel is even:
then append the curr level node list as it is to the resultList
else:
reverse the curr level node list and then append to the resultList.

Finally return the resultList.
Answered Anonymously
Add your answer
Q2. 
K Closest Points to Origin Problem Statement
Your house is located at the origin (0,0) of a 2-D plane. There are N neighbors living at different points on the plane. Your goal is to visit exactly K neighb...read more
Ans. 
As we need to find K closest restaurants to the source (0,0), I used priority queue(MaxHeap) in python to eliminate all the farthest restaurants and have only k closest restaurants left at the end of the loop.

I had stored the elements in priority Queue as a pair [distance, coordinates], so that at I can directly get the coordinates for the k closest restaurants to return in the result.
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical round (Questions on Java, Spring Boot, Microservices, Rest APIs, OOPs and Solid principals).

Round duration - 45 minutes
Round difficulty - Easy