Vishal Mega Mart Full Stack Developer Interview Questions and Answers

Round duration - 60 Minutes
Round difficulty - Medium

There were 2 coding questions given in this round. One was related to Dynamic Programming and the second one was related to Recursion and Number Theory.

Q1. 
House Robber Problem Statement
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...read more
Ans. 
House Robber problem where a robber wants to maximize stolen money without robbing adjacent houses in a circular street.
• Use dynamic programming to keep track of maximum stolen money at each house.

• Consider two cases: either rob the current house and skip the next, or skip the current house.

• Handle circular arrangement by considering the first and last houses separately.

• Example: For arr[] = {2, 3, 2}, the output is 3. Rob...read more
Answered by AI
Add your answer
Q2. 
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.
Input:
...read more
Ans. 
Calculate the Nth Fibonacci number efficiently using dynamic programming.
• Use dynamic programming to store and reuse previously calculated Fibonacci numbers.

• Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.

• Optimize the solution to avoid redundant calculations by storing intermediate results.

• Time complexity can be reduced to O(N) using dynamic programming.

• Example: For N = 5, the 5th F
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

Standard Data Structures and Algorithms round where I was given 2 questions to solve , one was from Linked List and the other was related to Priority Queue / Quick Sort .

Q1. 
Intersection of Linked Lists Problem Statement
You are provided with two linked lists, L1 and L2, both sorted in ascending order. Generate a new linked list containing elements that exist in both linked l...read more
Ans. 
Given two sorted linked lists, find the intersection of elements in both lists and return a new sorted linked list.
• Traverse both linked lists simultaneously to find common elements

• Create a new linked list to store the intersecting elements

• Ensure the final linked list is sorted in ascending order

• Handle cases where there are no common elements between the lists
Answered by AI
Add your answer
Q2. 
Kth Largest Element Problem Statement
Ninja enjoys working with numbers, and Alice challenges him to find the Kth largest value from a given list of numbers.
Input:
The first line contains an integer 'T...read more
Ans. 
Find the Kth largest element in a given list of numbers.
• Sort the array in descending order.

• Return the Kth element from the sorted array.

• Handle multiple test cases efficiently.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

This round majorly focused on Real life appications of Data Structures and also revolved around Object Oriented Programming Style of writing code .

Q1. 
Data Structure with Insert, Delete, and GetRandom Operations
Design a data structure that supports four operations: insert an element, remove an element, search for an element, and get a random element. E...read more
Ans. 
Design a data structure with insert, delete, search, and getRandom operations, all in constant time.
• Use a combination of HashMap and ArrayList to achieve constant time operations.

• For insert operation, add the element to the ArrayList and store its index in the HashMap.

• For delete operation, swap the element to be deleted with the last element in the ArrayList, update the index in the HashMap, and then remove the last el...read more
Answered by AI
Add your answer
Q2. 
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key) - Return the value of the key if it exists in the cache; otherw...read more
Ans. 
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
• Implement a doubly linked list to maintain the order of keys based on their recent usage.

• Use a hashmap to store key-value pairs for quick access.

• When capacity is reached, evict the least recently used item before inserting a new item.

• Update the position of a key in the linked list whenever it is accesse
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This round was inclined towards some Low Level Design Principles and some concepts from Java .

Q1. Design a Railway Reservation System.
Ans. 
Design a Railway Reservation System
• Create a database to store train schedules, seat availability, and passenger information

• Implement a user interface for users to search for trains, book tickets, and view their reservations

• Include features like seat selection, payment processing, and ticket confirmation

• Handle scenarios like waitlisting, cancellations, and refunds

• Ensure data security and privacy of passenger information
Answered by AI
Add your answer
Q2. Why is Java considered platform-independent while the Java Virtual Machine (JVM) is platform-dependent?
Ans. 
Java is platform-independent because the code is compiled into bytecode that can run on any platform with a JVM, which is platform-dependent due to its reliance on the underlying hardware and operating system.
• Java code is compiled into bytecode, which can run on any platform with a JVM.

• JVM acts as an interpreter that translates bytecode into machine code specific to the underlying hardware and operating system.

• The JVM ...read more
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the approach the time complexity and proper code covering all cases.

Q1. 
Minimum Cost to Buy Oranges Problem Statement
You are given a bag of capacity 'W' kg and a list 'cost' of costs for packets of oranges with different weights. Each element at the i-th position in the list...read more
Ans. 
Find the minimum cost to buy a specific weight of oranges using given cost list.
• Iterate through the cost list and find the minimum cost to achieve the desired weight

• Keep track of the minimum cost while considering available packet weights

• Return -1 if it is not possible to buy exactly W kg of oranges
Answered by AI
Add your answer
Q2. 
K - Sum Path In A Binary Tree
Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...read more
Ans. 
Find all paths in a binary tree where the sum of node values equals a given value 'K'.
• Traverse the binary tree using DFS and keep track of the current path and its sum.

• At each node, check if the current sum equals 'K' and add the path to the result if true.

• Continue traversal to the left and right child nodes recursively.

• Return the list of paths that sum up to 'K'.
Answered by AI
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

This round majorly focused on puzzles and some questions revolving around Computer Networks and the projects in my resume .

Q1. You have two wires of different lengths that take different times to burn. How can you measure a specific amount of time using these two wires?
Ans. 
Use two wires of different lengths to measure a specific amount of time by burning them simultaneously.
• Burn both wires at the same time, one wire will burn faster than the other.

• Measure the time it takes for the faster burning wire to completely burn.

• Calculate the specific amount of time by using the ratio of the lengths of the two wires.
Answered by AI
Add your answer
Q2. You have 3 ants located at the corners of a triangle. The challenge is to determine the movement pattern of the ants if they all start moving towards each other. What will be the outcome?
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Q1. What do you know about the company?
Add your answer
Q2. Why should we hire you?
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This was a proctured online coding round where we had 2 questions to solve under 90 minutes . The questions were of easy to medium level I would say with some lenghty implementations .

Q1. 
Minimum Numbers Required Problem Statement
Given an array 'ARR' consisting of N integers, along with two integers, 'SUM' and 'MAXVAL', you need to determine the minimum number of integers to be added to t...read more
Ans. 
Determine the minimum number of integers to be added to an array to make its sum equal to a given value.
• Iterate through the array and calculate the current sum.

• Determine the difference between the target sum and the current sum.

• Add the minimum number of integers within the range of -MAXVAL to MAXVAL to reach the target sum.
Answered by AI
Add your answer
Q2. 
Maximum Sum Subsequence Problem Statement
Given an array of integers NUMS consisting of N integers and an integer K, determine the maximum sum of an increasing subsequence with exactly K elements.
Exampl...read more
Ans. 
Find the maximum sum of an increasing subsequence with exactly K elements in an array of integers.
• Iterate through the array and maintain a dynamic programming table to store the maximum sum of increasing subsequences ending at each index.

• For each element, check all previous elements to find the increasing subsequence with maximum sum ending at that element.

• Update the dynamic programming table with the maximum sum found...read more
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

Standard Data Structures and Algorithms round . One has to be fairly comfortable in solving algorithmic problems to
pass this round with ease.

Q1. 
Check Whether Binary Tree Is Complete
You have been given a binary tree and your task is to determine if it is a Complete Binary Tree or not.
A Complete Binary Tree is defined as a binary tree where ever...read more
Ans. 
Check if a binary tree is a Complete Binary Tree or not based on given criteria.
• Traverse the binary tree level by level and check if all levels are completely filled except the last one.

• Ensure all nodes at the last level are positioned at the leftmost side.

• Use level order traversal to check for completeness of the binary tree.

• Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the output should be 1.
Answered by AI
Add your answer
Q2. 
Consecutive Elements
Given an array arr of N non-negative integers, determine whether the array consists of consecutive numbers. Return true if they do, and false otherwise.
Input:
The first line of inp...read more
Ans. 
Check if an array of integers consists of consecutive numbers.
• Iterate through the array and check if the absolute difference between consecutive elements is 1.

• Sort the array and check if the elements are consecutive.

• Use a set to store the elements and check if the size of the set is equal to the length of the array.
Answered by AI
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

This round majorly focused on my projects and some standard questions revolving around Operating Systems and DBMS.

Q1. How can you print numbers from 1 to 100 using more than two threads in an optimized approach?
Ans. 
Use multiple threads to print numbers from 1 to 100 in an optimized approach.
• Divide the range of numbers (1-100) among the threads to avoid duplication.

• Use synchronization mechanisms like mutex or semaphore to ensure proper order of printing.

• Consider using a shared data structure like a queue to coordinate the threads.

• Implement a mechanism to signal the threads when to start and stop printing.
Answered by AI
Add your answer
Q2. What are the advantages of using views in a database management system?
Ans. 
Views in a database management system provide data security, simplify complex queries, and improve performance.
• Enhanced security by restricting access to certain columns or rows

• Simplify complex queries by pre-defining joins and filters

• Reduce redundancy by storing commonly used queries as views

• Improve performance by storing pre-processed data in views

• Allow for data abstraction, making it easier to work with complex data
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Q1. What do you know about the company?
Add your answer
Q2. Why should we hire you?
Add your answer

Moderate level. It was easy to crack. There was few aptitude and coding questions associated

Q1. Questions on SQL
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Tell positive and negative points about you
Add your answer

They ask nothing only few questions on dsa

They ask previous projects knowledge

Html html means hyper text markup language
used for creation and display of webpage

Python
datatypes
strings
lists
sets
dictionary
tuples
functions

List of topics for aptitude test.
area average bankers discount boats and streams and clocks

Q1. Having special and usual practical knowledge especially of a mechanical and scientific subject a technical consultant
Add your answer
Q2. What is your most noteworthy achievement?
Add your answer

A process or record of research into the development of a particular person
group of situation over a period of time

Q1. HR stands for human resources
Add your answer

Q1. What motivates you at work?
Add your answer

Speak pleasantly and politely in the group
the future of twitter

Q1. Where did you undergo your technical training
Add your answer

Q1. Why should you hire you?
Add your answer

Q1. What is the purpose of a round?
Ans. 
A round is a circular object or a series of actions that lead back to the starting point.
• A round can refer to a circular object, such as a ball or a wheel.

• In music, a round is a song where different groups start singing the same melody at different times, creating a harmonious effect.

• In sports, a round can refer to a single game or match in a tournament.

• In conversation, a round can refer to each person taking a turn to...read more
Answered by AI
Add your answer

Development coding to webdesign

Cat exam
cat syllabus
free download

What is the purpose of a case study?

Q1. What are you greatest strengths?
Add your answer

Q1. Why do you think you quality of a human resource executive's manager position
Ans. 
I do not have the available data to answer this question.
Answered by AI
View 1 more answer

Learn in-demand skills and succeed in the sales force ecosystem

Quantitative aptitude
average tests average concepts

Some people are discussion whether

Q1. Dress from the job prepare for small talk
Add your answer

Focus your analysis identify two to five problems

Q1. Why did you decide company role
Ans. 
I decided on this company role because it aligns with my passion for full stack development and offers opportunities for growth.
• Passion for full stack development

• Opportunities for growth

• Alignment with company's goals and values
Answered by AI
Add your answer

Q1. In HR companies main aim judge the candidate personality,weakness strength
Add your answer

An assignment is a task that some one is authority has asked you to do

Quantitative aptitude tests questions and answers contains concepts basic newspaper

Q1. In HR company main aim to judge the candidate personality
Add your answer

Condition of states
use google image tags

Focus your analysis identify two to five problems

An assignment is a task and peace of work allocated to some one as part of a job or course of study

Read and examine the case through take notes highlight relevant facts

Q1. How indexing works internally?
Ans. 
Indexing in databases is a way to optimize search queries by creating a data structure that allows for faster retrieval of data.
• Indexing creates a data structure (like B-trees or hash tables) that maps keys to the locations of corresponding data entries.

• When a query is made, the database engine uses the index to quickly locate the relevant data entries instead of scanning the entire database.

• Indexes can be created on o...read more
Answered by AI
Add your answer

Q1. Intoduce yourself
Ans. 
I am a passionate software developer with experience in Java, Python, and web development.
• Experienced in Java and Python programming languages

• Proficient in web development technologies such as HTML, CSS, and JavaScript

• Strong problem-solving skills and ability to work in a team environment
Answered by AI
Add your answer
Q2. Your Projects
Ans. 
Developed a web application for tracking personal fitness goals
• Used React.js for front-end development

• Implemented RESTful APIs for data retrieval and storage

• Utilized MongoDB for database management
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This was a proctured online coding round where we had 2 questions to solve under 90 minutes . The questions were a bit lengthy but the implementation part was quite easy .

Q1. 
Encode the Message Problem Statement
Given a text message, your task is to return the Run-length Encoding of the given message.
Run-length encoding is a fast and simple method of encoding strings, repres...read more
Ans. 
Implement a function to encode a text message using run-length encoding.
• Iterate through the message and count consecutive characters

• Append the character and its count to the encoded message

• Handle edge cases like single characters or empty message
Answered by AI
Add your answer
Q2. 
Make All Elements of the Array Distinct
Given an array/list ARR of integers with size 'N', your task is to determine the minimum number of increments needed to make all elements of the array distinct. You...read more
Ans. 
Find the minimum number of increments needed to make all elements of the array distinct by increasing any element by 1 in each operation.
• Iterate through the array and keep track of the frequency of each element.

• For each element with frequency greater than 1, increment it until it becomes distinct.

• Return the total number of operations needed to make all elements distinct.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

This Round was DS/Algo + Core round and it started with formal introduction, followed by 3 problems. We first dicussed the
approach the time complexity and proper code covering all cases for the 2 coding problems . The last question was related to OS and was a bit theoretical .

Q1. 
Distinct Characters Problem Statement
Given a string STR, return all possible non-empty subsequences with distinct characters. The order of the strings returned is not important.
Example:
Input:
STR = ...read more
Ans. 
Return all possible non-empty subsequences with distinct characters from a given string.
• Use a recursive approach to generate all possible subsequences with distinct characters.

• Keep track of the characters used in each subsequence to ensure uniqueness.

• Return the generated subsequences as an array of strings.
Answered by AI
Add your answer
Q2. 
Calculate Score of Balanced Parentheses
In this intellectual game, Ninja is provided with a string of balanced parentheses called STR. The aim is to calculate the score based on specific game rules. If Nin...read more
Ans. 
Calculate the score of a string of balanced parentheses based on specific game rules.
• Iterate through the string and keep track of the score based on the rules provided

• Use a stack to keep track of the scores of valid parentheses expressions

• For each '()', increment the score by 1; for '(x)', double the score of x

• Return the final computed score for the string
Answered by AI
Add your answer
Q3. Can you explain demand paging?
Ans. 
Demand paging is a memory management technique where pages are loaded into memory only when they are needed.
• Pages are loaded into memory on demand, rather than all at once.

• Helps in reducing the amount of physical memory needed.

• Improves overall system performance by allowing more processes to run simultaneously.

• Commonly used in modern operating systems like Linux and Windows.

• Example: When a program is executed, only the...read more
Answered by AI
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

I was given 2 preety good questions of DSA in this round . One was related to Binary Trees and the other was a good DP problem in which I struggled a bit but with some hints I was able to solve this problem too . The last question was related to OOPS and was preety easy .

Q1. 
Binary Tree Construction from Traversals Problem
Given the POSTORDER and PREORDER traversals of a binary tree, where the tree consists of N nodes with each node representing a distinct positive integer fr...read more
Ans. 
Construct a binary tree from given POSTORDER and PREORDER traversals.
• Use the first element in PREORDER as the root node

• Find the root node in POSTORDER to divide the tree into left and right subtrees

• Recursively construct left and right subtrees using the divided traversals
Answered by AI
Add your answer
Q2. 
Minimum Cost to Buy Oranges Problem Statement
You are given a bag of capacity 'W' kg and a list 'cost' of costs for packets of oranges with different weights. Each element at the i-th position in the list...read more
Ans. 
Find the minimum cost to buy a specific weight of oranges given the cost of different weight packets.
• Iterate through the list of costs and find the minimum cost to achieve the desired weight.

• Keep track of the minimum cost for each weight up to the desired weight.

• Handle cases where a specific weight packet is unavailable by setting the cost to infinity.

• Return the minimum cost for the desired weight, or -1 if it is not p
Answered by AI
Add your answer
Q3. Can you explain the concepts of static and dynamic polymorphism in Object-Oriented Programming?
Ans. 
Static polymorphism is achieved at compile time through method overloading and overriding. Dynamic polymorphism is achieved at runtime through method overriding.
• Static polymorphism is also known as compile-time polymorphism.

• Dynamic polymorphism is also known as runtime polymorphism.

• Static polymorphism is achieved through method overloading, where multiple methods have the same name but different parameters.

• Dynamic poly...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Q1. Why should we hire you?
Add your answer
Q2. What do you know about the company?
Add your answer