Vegrow Software Engineer Interview Questions and Answers

Q1. Js question with code snippets
Add your answer

Given some ant ui design to reacreate from scretch

Q1. Asked system design for online movie booking plateform
Add your answer

Q1. 2 DSA question medium leetcode
Add your answer

Q1. 1 Dsa question and about projects
Add your answer

4 DSA questions only pseudo codes were asked

Q1. Past experience, database and projects, Language specific if python or NodeJs
Add your answer
Q2. Javascipt fundamentals
Add your answer

Q1. General DSA question leetcode style
Add your answer

Q1. Discussion on previous project
Add your answer

Q1. Coding question DSA
Add your answer

Q1. LLD quation and tech discussion
Add your answer
Q2. LLd question and general discussion
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

Q1. 
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...read more
Ans. 
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
• Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

• Use level-order input to construct the Binary Tree.

• Traverse the Binary Tree recursively to generate the required traversals.

• Ensure proper handling of null nodes represented by -1 in the input.

• Return the three traversals as
Answered by AI
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege...read more
Ans. 
Reverse a singly linked list by altering the links between nodes.
• Iterate through the linked list and reverse the links between nodes

• Use three pointers to keep track of the current, previous, and next nodes

• Update the links between nodes to reverse the list

• Return the head of the reversed linked list
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

Q1. 
Intersection of Two Arrays Problem Statement
Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...read more
Ans. 
The problem involves finding the intersection of two sorted arrays efficiently.
• Use two pointers to iterate through both arrays simultaneously.

• Compare elements at the pointers and move the pointers accordingly.

• Handle cases where elements are equal and update the intersection array.

• Return the intersection array as the result.
Answered by AI
Add your answer

Q1. Problem solving
Add your answer
Q2. Basic js question
Add your answer

System design - ecommers website and project related

Js + react js questions

Round duration - 120 minutes
Round difficulty - Medium

Round duration - 120 minutes
Round difficulty - Medium

- Discussion on the first round's assignment
- Was asked about adding unit tests in the assignment
- Fundamental questions on the approach used for the assignment.

Q1. What are some things that could have been done better in the system design problem given in the first round?
Ans. 
Some improvements in the system design problem could include better scalability planning, more efficient data storage solutions, and improved error handling.
• Implementing a more robust caching mechanism to improve performance under heavy load.

• Optimizing the database schema for better query performance and scalability.

• Introducing load balancing and horizontal scaling to handle increased traffic.

• Enhancing error handling t...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Round was with tech lead. Was briefly asked about the problem I solved in the first round. Then I was asked to solve 1 medium level DSA based question. Some discussion on culture fit was also done.

Q1. Given the frequency of traffic lights' states, can you determine if there will ever be an invalid state for the traffic signal, and what are the conditions that lead to an invalid state?
Ans. 
Yes, an invalid state can occur if the traffic lights are in conflicting states simultaneously.
• An invalid state occurs when multiple traffic lights are showing conflicting signals, such as both red and green at the same time.

• This can happen due to a malfunction in the traffic light system or human error in programming the lights.

• For example, if a traffic light is stuck showing both red and green signals, it would be co
Answered by AI
Add your answer