Vyom Labs Java Developer Interview Questions and Answers

Round duration - 30 minutes
Round difficulty - Medium

This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.

Round duration - 60 minutes
Round difficulty - Medium

In this test round, 2 coding questions were given. Either write the code or pseudo code

Q1. 
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Ans. 
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
• Use backtracking algorithm to explore all possible configurations.

• Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

• Generate all valid configurations and print them out.
Answered by AI
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
Sort an array of 0s, 1s, and 2s in linear time complexity.
• Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

• Swap elements based on the values encountered to sort the array in-place.

• Time complexity should be O(N) and space complexity should be O(1).
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DSA.

Q1. 
Reverse Words in a String: Problem Statement
You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...read more
Ans. 
Reverse words in a string while handling leading, trailing, and multiple spaces.
• Split the input string by spaces to get individual words

• Reverse the order of the words

• Join the reversed words with a single space in between
Answered by AI
Add your answer
Q2. 
Circular Linked List Detection
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
Note:
• A linked list is considered circula...read more
Ans. 
Detect if a given linked list is circular by checking if it forms a closed loop.
• Traverse the linked list using two pointers, one moving at double the speed of the other.

• If the two pointers meet at any point, the linked list is circular.

• If the faster pointer reaches the end of the list (NULL), the linked list is not circular.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Aptitude and coding of 2 hours

Q1. Questions based on sql and dsa
Add your answer

It was an 1hr interview session

Q1. Find the occurrence of each element in an array
Ans. 
Count the occurrence of each element in an array of strings
• Iterate through the array and use a hashmap to store the count of each element

• If element already exists in the hashmap, increment its count by 1

• Return the hashmap with element counts
Answered by AI
Add your answer

Q1. Tell me about yourself
Add your answer

Easy 1 hr test and can be completed easily

Q1. SQL queries more focus on analytic side
Add your answer
Q2. DSA + OOPS
Add your answer

Coding test was really good it was easier to tackle the problem and writting code for it.

Q1. Can you tell me about yourself?
Add your answer
Q2. What is the major project you have worked on, and can you provide an explanation of it?
Ans. 
Developed a web-based project management tool for tracking tasks and deadlines.
• Used React.js for front-end development

• Implemented RESTful APIs using Node.js and Express

• Utilized MongoDB for database storage

• Incorporated authentication and authorization features for user security
Answered by AI
Add your answer

Q1. SQL ques and concept
Add your answer

Total two DSA question and 25 mcqs

Q1. Zigzag traversal of binary tree
Add your answer
Q2. Minimum swaps to group all ones together
Ans. 
The minimum number of swaps needed to group all ones together in an array of 0s and 1s.
• Iterate through the array to count the total number of ones.

• Use a sliding window of size equal to the total number of ones to find the window with the minimum number of zeros.

• Calculate the number of swaps needed to move all ones to that window.
Answered by AI
Add your answer