Tech Vedika Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

Coding Round:
Questions -3
Time- 90 min
Topic- DP, Array, String

Q1. 
Left Rotations of an Array
Given an array of size N and Q queries, each query requires left rotating the original array by a specified number of elements. Return the modified array for each query.
Input:
...read more
Ans. 
Rotate an array left by a specified number of elements for each query.
• Iterate through each query and rotate the array left by the specified number of elements using array slicing.

• Handle cases where the number of rotations exceeds the length of the array by taking the modulo of the rotations.

• Return the modified array after each query is processed.
Answered by AI
Add your answer
Q2. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. 
The task is to find the total number of ways to make change for a specified value using given denominations.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the number of ways to make change for each value up to the specified value.

• Iterate through each denomination and update the array accordingly.

• The final answer will be stored in the last cell of the array.

• Example: For N=3, D=[1, 2...read more
Answered by AI
Add your answer
Q3. 
String Transformation Problem
Given a string (STR) of length N, you are tasked to create a new string through the following method:
Select the smallest character from the first K characters of STR, remov...read more
Ans. 
Given a string and an integer K, create a new string by selecting the smallest character from the first K characters of the input string and repeating the process until the input string is empty.
• Iterate through the input string, selecting the smallest character from the first K characters each time.

• Remove the selected character from the input string and append it to the new string.

• Continue this process until the input ...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

In this round 3 coding question were asked. 
1 - algorithm based ( medium) 
2- array based ( easy) 
3- string based (easy)

Q1. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. 
The task is to determine the total number of ways to make change for a specified value using given denominations.
• Create a dynamic programming table to store the number of ways to make change for each value up to the target value.

• Iterate through each denomination and update the table accordingly based on the current denomination.

• The final value in the table will represent the total number of ways to make change for the ...read more
Answered by AI
Add your answer
Q2. 
Left Rotations of an Array
You are given an array consisting of N elements and need to perform Q queries on that array. Each query consists of an integer indicating the number of elements by which the arr...read more
Ans. 
Perform left rotations on an array based on given queries.
• Create a function that takes the array, number of elements, number of queries, and the queries as input.

• For each query, rotate the array by the specified number of elements to the left.

• Return the final array after each rotation query.
Answered by AI
Add your answer
Q3. 
Chocolate Distribution Problem
You are given an array/list CHOCOLATES of size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'...read more
Ans. 
The task is to distribute chocolates among students such that the difference between the largest and smallest number of chocolates is minimized.
• Sort the array of chocolates packets

• Use sliding window technique to find the minimum difference between the largest and smallest number of chocolates distributed to students

• Return the minimum difference
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Involved some basic question based on DSA and Java script framework and project discussion

Q1. What are some basic questions you were asked about JavaScript?
Ans. 
Basic questions about JavaScript in a software engineering interview
• Explain the difference between '==' and '===' operators

• What is closure in JavaScript?

• How does prototypal inheritance work in JavaScript?

• What is event delegation in JavaScript?

• How do you handle asynchronous operations in JavaScript?
Answered by AI
Add your answer
Q2. MYSQL query
Questions on mysql and database.
Ans. 
The question is about MYSQL query and database.
• Understand the database schema before writing the query

• Use proper indexing to optimize query performance

• Avoid using SELECT * and only fetch necessary columns

• Use WHERE clause to filter results based on conditions
Answered by AI
Add your answer
Q3. Can you describe the projects listed on your resume?
Add your answer
Q4. Node js basic question
Questions on basic node js concepts.
Ans. 
Node.js is a runtime environment that allows you to run JavaScript on the server side.
• Node.js uses an event-driven, non-blocking I/O model that makes it lightweight and efficient.

• It is commonly used for building server-side applications, APIs, and real-time web applications.

• Node.js is built on the V8 JavaScript engine and uses an event loop for handling asynchronous operations.

• Modules in Node.js are reusable pieces of ...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was the CTO round involving some technology based questions