Vishal Mega Mart Software Engineer Interview Questions and Answers

Q1. Problem solving - Understanding of data structure & algorithm
Add your answer

Q1. System design = Low level design round
Add your answer

Q1. Hiring manager round - Team fitment, current project
Add your answer

Q1. Prepare for Java, SQL & Unix and if you are experienced, you should know what your roles and responsibilities are
Add your answer

Q1. Need to have an in depth knowledge of SQL concepts
Add your answer

Basic Java Program

Q1. Find longest substring
Ans. 
Find the longest substring in an array of strings.
• Iterate through each string and compare with all other strings to find common substrings.

• Use a hash table to keep track of the frequency of each substring.

• Return the substring with the highest frequency.
Answered by AI
Add your answer

The coding test was on hackerearth with 2 coding questions and Java based output questions.

Q1. 3 DSA questions on DP, binary search
Add your answer

Mostly on js basics. Event loop, hoisting, GraphQL

Q1. How to implement Cadence algorithm
Ans. 
Cadence algorithm is used for real-time stream processing of data.
• Cadence is a distributed system for managing workflows.

• It uses a programming model called the Cadence Workflow Model.

• The Cadence server is responsible for managing the state of workflows.

• The Cadence client is responsible for executing the workflow tasks.

• Cadence provides a lot of features like retries, timeouts, and error handling.
Answered by AI
Add your answer
Q2. How does vdom works in react
Ans. 
VDOM stands for Virtual Document Object Model, which is a lightweight copy of the actual DOM used by React for efficient rendering.
• VDOM is a tree-like structure that React uses to keep track of changes in the UI.

• When a component's state changes, React creates a new VDOM tree and compares it with the previous one to identify the changes.

• React then updates only the parts of the actual DOM that need to be changed, resulti...read more
Answered by AI
Add your answer

Q1. Linked List Intersection Point
Ans. 
Find the intersection point of two linked lists.
• Use two pointers to traverse the linked lists

• Calculate the difference in length between the two lists

• Move the pointer of the longer list ahead by the difference

• Move both pointers simultaneously until they meet at the intersection point
Answered by AI
Add your answer
Q2. Basic Spring Boot
Add your answer
Q3. Stream and Java 8 Questions
Add your answer