i
GoMechanic
Filter interviews by
I was interviewed in Jan 2021.
Round duration - 120 Minutes
Round difficulty - Easy
It is vesy helpful to learn more about this topic and improve my knowledge in the specific areas
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
Start burning from the given node and spread fire to adjacent nodes each minute
Track the time taken for each node to burn completely
Return the maximum time taken to burn the entire tree
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
Iterate through the array of stock prices to find the maximum profit that can be achieved by buying and selling stocks at different points.
Keep track of the maximum profit that can be obtained by performing two transactions.
Consider all possible combinations of buying and sel...
Round duration - 120 Minutes
Round difficulty - Easy
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the result list based on the criteria mentioned in the problem statement.
Given a singly linked list of integers, the task is to remove the middle node from this list.
The first line of input includes an integer 'T' whic...
Remove the middle node from a singly linked list of integers.
Identify the middle node using slow and fast pointers.
Remove the middle node by adjusting the pointers.
Handle cases where there are two middle nodes.
Return NULL if no middle node exists.
Round duration - 50 Minutes
Round difficulty - Easy
Suppose you have a string 'S' representing an arithmetic expression. Your task is to compute all potential outcomes by adding valid parentheses in different ways to evalu...
Compute all potential outcomes by adding valid parentheses in different ways to evaluate an arithmetic expression.
Iterate through the expression and try adding parentheses at different positions to evaluate all possible outcomes
Use recursion to explore all possible combinations of adding parentheses
Keep track of the valid outcomes and return them as a list of results
Tip 1 : practice questions and prepare for your future and do your best to get success in life
Application resume tips for other job seekersTip 1 : must include your project in your resume to give a proper idera about your capabilities and four talent
Tip 2 : also must include your training and complete experience and learning of your training
I applied via Campus Placement and was interviewed in Jun 2022. There were 3 interview rounds.
Consists of 5 questions of DSA
1 Knapsack, 1 bitwise, 1 string , 1 basic mathematics, 1 dynamic programming
I applied via Walk-in and was interviewed in May 2024. There were 2 interview rounds.
Was bit tough and need to concentrate on work time
Was about coding in any language such as Java python
25 basic aptitude asked from train,time and work
2 coding questions which was basic and medium questions
I applied via Campus Placement and was interviewed in Nov 2022. There were 4 interview rounds.
Indexing is a technique used to improve the performance of database queries by creating a data structure that allows for faster data retrieval.
Indexing involves creating a separate data structure that contains a subset of the data in the database, organized in a way that makes it easier to search and retrieve.
Indexes can be created on one or more columns in a table, and can be either clustered or non-clustered.
Clustere...
Print prime numbers using recursion
Define a recursive function that takes a number as input
Check if the number is prime or not
If it is prime, print it and call the function again with the next number
If it is not prime, call the function again with the next number
Stop the recursion when the desired number of prime numbers have been printed
I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.
Basic aptitude with tracing program
3 problem with easy to hard
I applied via Recruitment Consulltant and was interviewed in Dec 2022. There were 4 interview rounds.
Medium level array question was asked on hackerrank.
I was interviewed in Jul 2024.
2 Graph question of leetcode
I was interviewed before Jul 2023.
Build a sample app server using express.js
Install express.js using npm
Create a new express app
Set up routes and middleware
Start the server to listen on a specific port
I use JDBC (Java Database Connectivity) to establish connection with the database in my project.
Use JDBC API to connect to the database
Load the JDBC driver
Create a connection object
Create a statement object
Execute SQL queries
Multer is a middleware for handling multipart/form-data, used for file uploads in Node.js.
Install multer package using npm: npm install multer
Require multer in your Node.js file: const multer = require('multer')
Set up multer middleware with desired options: const upload = multer({ dest: 'uploads/' })
Use the upload middleware in your route handler to process file uploads
The exam duration is one and a half hours.
The total exam time is one and a half hours.
It encompasses all topics related to full stack development.
In two years, I see myself as a senior software developer leading a team on innovative projects.
Advancing to a senior software developer role
Leading a team on new and innovative projects
Continuing to enhance my technical skills through ongoing learning and training
Customer Relationship Manager
224
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Manager
63
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
57
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
52
salaries
| ₹0 L/yr - ₹0 L/yr |
Deputy Manager
45
salaries
| ₹0 L/yr - ₹0 L/yr |
Pitstop
Carcrew Technology
Bumper
Carpathy