AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Buyhatke Interview Questions and Answers
10 Interview questions
Node.js is a JavaScript runtime built on Chrome's V8 engine, enabling server-side scripting and building scalable network applications.
Asynchronous and event-driven, allowing for non-blocking I/O operations.
Uses JavaScript, making it easy for front-end developers to transition to back-end development.
Ideal for building real-time applications like chat apps or online gaming.
NPM (Node Package Manager) provides acces...
Indexing is a data structure technique that improves the speed of data retrieval operations on a database or data set.
Indexing creates a data structure (like a table) that allows for faster searches.
For example, a book index helps locate topics quickly without reading the entire book.
In databases, an index on a column speeds up queries that filter or sort by that column.
Types of indexing include B-trees, hash inde...
LCA of a binary tree is the lowest common ancestor of two nodes in the tree.
Traverse the tree from the root node to find the paths from root to the two given nodes.
Compare the paths to find the last common node, which is the LCA.
Use recursion to solve the problem efficiently.
Handle edge cases like if one of the nodes is the ancestor of the other.
Observable in Swift is a property wrapper that allows for automatic notifications when the value changes.
Observable is a property wrapper introduced in Swift 5.1.
It can be used with any property that needs to be observed for changes.
When the value of the property changes, any views using that property will be automatically updated.
Example: @Published var score: Int = 0
Swift was chosen for its performance, native iOS support, and better integration with Apple's ecosystem.
Swift offers better performance compared to React Native due to its native code execution.
Swift provides seamless integration with Apple's ecosystem, allowing for better utilization of iOS features.
Swift is the preferred choice for developing iOS apps as it is the native language for iOS development.
React Native...
Depth first search in tree is implemented using recursion to explore each branch fully before moving to the next.
Start at the root node and recursively visit each child node before moving to the next sibling node.
Use a stack to keep track of nodes to visit, pushing children onto the stack before siblings.
Base case is when the current node is null or a leaf node, then backtrack to the parent node.
Foreign keys are columns in a database table that reference the primary key of another table, establishing a relationship between the two tables.
Foreign keys ensure referential integrity in a database by enforcing relationships between tables.
They help maintain data consistency by preventing actions that would violate the relationships between tables.
For example, in a database with tables for 'orders' and 'custome...
Shortest Route Problem Statement
You want to visit your friend’s house located at some position in an infinite grid starting from origin (0, 0). You can move in four directions: East (E), West (W), North (...
Given a directional string representing a route to a friend's house in an infinite grid, find the shortest lexicographically smallest route to reach the destination.
Iterate through the directional string and keep track of the movements in each direction (E, W, N, S).
Calculate the final position based on the movements and find the shortest lexicographically smallest route to reach that position.
Consider the constra...
0/1 Knapsack Problem Statement
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of ...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Time to Burn Tree Problem
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 bu...
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
Buyhatke Interview Experiences
7 interviews found
Anonymous
2 hours of basic dsa
(2 Questions)
- Q1. What are foreign keys
- Ans.
Foreign keys are columns in a database table that reference the primary key of another table, establishing a relationship between the two tables.
Foreign keys ensure referential integrity in a database by enforcing relationships between tables.
They help maintain data consistency by preventing actions that would violate the relationships between tables.
For example, in a database with tables for 'orders' and 'customers', ...
- Q2. Implement depth first search in tree
- Ans.
Depth first search in tree is implemented using recursion to explore each branch fully before moving to the next.
Start at the root node and recursively visit each child node before moving to the next sibling node.
Use a stack to keep track of nodes to visit, pushing children onto the stack before siblings.
Base case is when the current node is null or a leaf node, then backtrack to the parent node.
Skills evaluated in this interview
Shiv Tej
4 DSA questions, 10 Questions of SQL queries, MCQS of APIS, DBMS
(3 Questions)
- Q1. DBMS concepts as Normalization , Indexing, ACID properties, SQL queries. OS , OOPs questions
- Q2. Backend Fundamental focusing on APIs, NodeJs, JavaScript
- Q3. Medium level DSA question
I applied via Referral and was interviewed in Sep 2024. There were 2 interview rounds.
They given 4 question based on DSA topics such as graph, DP, Array . All questions level medium to hard .
(2 Questions)
- Q1. Question Based on Completely Resume based
- Q2. Asked a leetcode hard question
Interview Preparation Tips
- DSA
- Resume
I had to make a to-do list application using Kotlin/Swift/React Native
(2 Questions)
- Q1. What is Observable in Swift?
- Ans.
Observable in Swift is a property wrapper that allows for automatic notifications when the value changes.
Observable is a property wrapper introduced in Swift 5.1.
It can be used with any property that needs to be observed for changes.
When the value of the property changes, any views using that property will be automatically updated.
Example: @Published var score: Int = 0
- Q2. Why did you use Swift over React Native?
- Ans.
Swift was chosen for its performance, native iOS support, and better integration with Apple's ecosystem.
Swift offers better performance compared to React Native due to its native code execution.
Swift provides seamless integration with Apple's ecosystem, allowing for better utilization of iOS features.
Swift is the preferred choice for developing iOS apps as it is the native language for iOS development.
React Native may ...
Skills evaluated in this interview
I appeared for an interview in Mar 2025, where I was asked the following questions.
- Q1. Introduce yourself
- Q2. Second question was a dsa question, it was a medium level leetcode question
- Q3. What is nodejs
- Ans.
Node.js is a JavaScript runtime built on Chrome's V8 engine, enabling server-side scripting and building scalable network applications.
Asynchronous and event-driven, allowing for non-blocking I/O operations.
Uses JavaScript, making it easy for front-end developers to transition to back-end development.
Ideal for building real-time applications like chat apps or online gaming.
NPM (Node Package Manager) provides access to ...
- Q4. What is indexing
- Ans.
Indexing is a data structure technique that improves the speed of data retrieval operations on a database or data set.
Indexing creates a data structure (like a table) that allows for faster searches.
For example, a book index helps locate topics quickly without reading the entire book.
In databases, an index on a column speeds up queries that filter or sort by that column.
Types of indexing include B-trees, hash indexing,...
I appeared for an interview in May 2024.
It involved 3-4 questions on dsa.
(1 Question)
- Q1. Find LCA of a binary tree, standard dsa medium problem
- Ans.
LCA of a binary tree is the lowest common ancestor of two nodes in the tree.
Traverse the tree from the root node to find the paths from root to the two given nodes.
Compare the paths to find the last common node, which is the LCA.
Use recursion to solve the problem efficiently.
Handle edge cases like if one of the nodes is the ancestor of the other.
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(3 Questions)
Round duration - 90 minutes
Round difficulty - Medium
- Q1.
Time to Burn Tree Problem
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...
- Ans.
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
- Q2.
0/1 Knapsack Problem Statement
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
- Ans.
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
- Q3.
Shortest Route Problem Statement
You want to visit your friend’s house located at some position in an infinite grid starting from origin (0, 0). You can move in four directions: East (E), West (W), North ...
- Ans.
Given a directional string representing a route to a friend's house in an infinite grid, find the shortest lexicographically smallest route to reach the destination.
Iterate through the directional string and keep track of the movements in each direction (E, W, N, S).
Calculate the final position based on the movements and find the shortest lexicographically smallest route to reach that position.
Consider the constraints ...
Interview Preparation Tips
Tip 1 : Strengthen DSA skills initially, know the basics and understand the working of different data structures
Tip 2 : Learn to implement them and enhance your coding skills. Make mistakes and learn from them instead of just cramming everything before practicing.
Tip 3 : To enhance coding skills, try your best to crack a question instead of giving up and looking at the solution. This will improve your problem-solving skills.
Tip 1 : Make sure your resume fits everything into a single page.
Tip 2 : Have at least 2 projects on your resume.
Tip 3 : Only Mention only those technical skills that you are confident in. Do not put false things on your resume.
Tip 4 : Mention the work you have done during your internships.
Tip 5 : Include an objective in your resume.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I applied via Naukri.com and was interviewed in Sep 2019. There were 4 interview rounds.
Interview Questionnaire
3 Questions
- Q1. How to increase business?
- Ans.
To increase business, focus on customer satisfaction, expand marketing efforts, and offer promotions.
Improve customer service to increase customer satisfaction and loyalty
Expand marketing efforts through social media, email marketing, and targeted advertising
Offer promotions such as discounts, referral programs, and loyalty rewards
Analyze market trends and adjust business strategies accordingly
Collaborate with other bu...
- Q2. Case study and solutions to business problem
- Q3. Experience
Interview Preparation Tips
The interview was ,
Written test,
Group discussion,
Interview with Manager.
You need to be prepared for ground level questions.
I applied via Internshala and was interviewed in Jun 2019. There were 4 interview rounds.
Interview Questionnaire
1 Question
- Q1. Why do you want to work at ambition box?
- Ans.
I want to work at Ambition Box because of its innovative work culture and opportunities for growth.
Innovative work culture
Opportunities for growth
Positive company reputation
Interview Preparation Tips
I applied via Naukri.com and was interviewed in Jun 2019. There were 3 interview rounds.
Interview Questionnaire
2 Questions
- Q1. 1) Tell About Yourself
- Ans.
I am a motivated and enthusiastic individual with a strong passion for learning and gaining practical experience in the field of [field].
I am currently pursuing a degree in [field] at [university].
I have completed internships at [company] and [company], where I gained valuable skills in [specific skills].
I am proficient in [programming languages/tools] and have experience in [relevant experience].
I am a quick learner a...
- Q2. What are your future plans?
- Ans.
I plan to gain valuable experience and skills through this internship and use it as a stepping stone for my future career.
I plan to learn as much as possible during this internship and apply the knowledge in my future endeavors.
I aim to develop strong professional relationships and network with industry experts.
I intend to explore different areas within the company to gain a well-rounded understanding of the business.
I...
Interview Preparation Tips
2)Give honest answers.
3)Have a full knowledge about the company and your role in it.
Buyhatke Interview FAQs
Tell us how to improve this page.
Buyhatke Interviews By Designations
Interview Questions for Popular Designations
Overall Interview Experience Rating
based on 9 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
Buyhatke Reviews and Ratings
based on 12 reviews
Rating in categories
3-10 Yrs
Not Disclosed
3-8 Yrs
Not Disclosed
|
Software Development Engineer
5
salaries
|  ₹10 L/yr - ₹20.2 L/yr |
|
Product Designer
5
salaries
| ₹5.4 L/yr - ₹12 L/yr |
|
Software Engineer
4
salaries
| ₹15 L/yr - ₹36 L/yr |
|
Software Developer
4
salaries
| ₹12 L/yr - ₹14.5 L/yr |
|
Business Development Manager
4
salaries
| ₹7 L/yr - ₹7 L/yr |
Udaan
Swiggy
CARS24
BlackBuck
- Home >
- Interviews >
- Buyhatke Interview Questions
