Vatech Interview Questions and Answers

Q1. Explain ELK stack
Ans. 
ELK stack is a popular open-source log management solution consisting of Elasticsearch, Logstash, and Kibana.
• ELK stack stands for Elasticsearch, Logstash, and Kibana.

• Elasticsearch is a distributed search and analytics engine for storing and searching data.

• Logstash is a data processing pipeline that ingests, transforms, and enriches data.

• Kibana is a data visualization tool used to analyze and visualize the data stored i...read more
Answered by AI
Add your answer

Q1. Leetcode task easy and medium
Add your answer
Q2. Leetcode task medium and spring boot
Add your answer

Write debounce in js, with leading and trailing edge. A react question, make 5 star a rating widget.

Q1. About qualification
Add your answer
Q2. About sales experience
Add your answer

Q1. Tell me about your self
Add your answer
Q2. Currently which type of work
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This round had 2 coding questions. In both of them, You need to implement those functions such that it returns the correct answer based on what the problem is about.

Q1. 
Find Duplicates in an Array
Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...read more
Ans. Sorting
1. The most trivial approach would be to sort the array/list ‘ARR’ and then return the duplicates.
2. After sorting the array in non-decreasing order, do the following for all the elements from i = 0 to i = n - 2:
   • If ARR[i] == ARR[i + 1], then add ARR[i] to the the output list.
   • While ARR[i] == ARR[i + 1], do i = i + 1, since we don’t want to add the same duplicate elements again and again.
   • Else continue.
3. After this loop, w...read more
Answered Anonymously
Add your answer
Q2. 
Version Comparison
Given two strings, Version1 and Version2, each representing version numbers, determine which one is the latest version.
Explanation:
The input strings consist of digits and dots only....read more
Ans. Using Recursion
The idea is to use a recursive approach to compare the versions. Here we will start iterating through both the strings to extract the number till we reach a dot (or the end of the string) and we will compare both the numbers. If they are the same, we will recursively compare the remaining string. If they are different, we will find out which one of them is bigger and will return the result of the compari...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

The Interviewer has 5 years of experience and was very friendly. He introduced himself first and asked me for a quick introduction. Then he jumped into coding questions

Q1. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. Flood Fill Algorithm
We can use the flood fill algorithm to check for all connected 1s.
 
• We create two arrays, dx, and dy, in which we store the unit vectors for all eight directions. Thus, when we are at a given cell, we can easily check for all its adjacent cells by simply looping over the two arrays, adding their values to the current position, and checking for this new position recursively.
• We will also create a ...read more
Answered Anonymously
Add your answer
Q2. 
Incremental Partitioning Problem Statement
Given two integers N and K, determine how many ways you can partition the number N into K non-empty groups such that the size of each group[i] >= group[i-1] f...read more
Ans. Using Recursion
• We can use a recursive approach to find the number of ways to divide N into K groups incrementally.
• Our current answer depends on the number of items we have (N), the number of groups we are left with and the size of the last group we used.
• Say we are in the ith group. We can try to fill the current group with every possible number and then solve the problem with smaller constraints.
• So let incrementalParti...read more
Answered Anonymously
Add your answer