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
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
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 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
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
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 appeared for an interview before Sep 2021.
(1 Question)
- Q1. Tell me something about your self and your previous organisation?
- Ans.
Dynamic sales executive with 5 years of experience in driving revenue growth and building client relationships in the tech industry.
Worked at Tech Solutions Inc. as a Sales Executive, achieving 120% of my sales target in the last fiscal year.
Developed strong relationships with clients, resulting in a 30% increase in repeat business.
Implemented a new CRM system that improved lead tracking and follow-up efficiency by 40%...
(1 Question)
- Q1. Why you want to join this organisation?
- Ans.
I am drawn to this organization for its innovative approach, strong values, and commitment to employee growth and customer satisfaction.
The organization's reputation for innovation aligns with my passion for staying ahead in sales strategies.
I admire your commitment to customer satisfaction, as seen in your recent award for outstanding service.
The emphasis on employee development through training programs resonates wit...
Interview Preparation Tips
I applied via Other and was interviewed in Dec 2020. There was 1 interview round.
Interview Questionnaire
2 Questions
- Q1. Are you happy?
- Ans.
Happiness is a state of mind influenced by personal achievements, relationships, and a positive outlook on life.
I find joy in achieving sales targets, which motivates me to perform better.
Building strong relationships with clients brings me satisfaction and happiness.
I enjoy collaborating with my team, sharing successes, and learning from each other.
Personal growth through challenges in sales keeps me engaged and happy...
- Q2. Where you go when you make holiday
- Ans.
I love exploring new cultures and relaxing on beautiful beaches during my holidays, often visiting places like Bali or the Amalfi Coast.
I enjoy beach destinations, such as Bali, for relaxation and water sports.
Cultural trips to cities like Paris or Rome allow me to immerse in history and art.
I also appreciate nature retreats, like hiking in the Swiss Alps or visiting national parks.
Interview Preparation Tips
I applied via Naukri.com and was interviewed in Sep 2019. There was 1 interview round.
Interview Questionnaire
5 Questions
- Q1. Question 1)Tell me about yourself and qualifications?
- Ans.
I am a recent graduate with a degree in Computer Science and experience in web development.
Recent graduate with a degree in Computer Science
Experience in web development
Strong problem-solving skills
Proficient in programming languages such as Java, JavaScript, and HTML/CSS
- Q2. Question 2)What are your hobbies?
- Ans.
My hobbies include reading, hiking, and playing the guitar.
Reading: I enjoy reading fiction and non-fiction books in my free time.
Hiking: I love exploring nature trails and challenging myself with new hikes.
Playing the guitar: I have been playing the guitar for several years and enjoy learning new songs.
- Q3. Question 3)What do you know about our company?
- Ans.
Our company is a leading tech startup specializing in AI-driven solutions for businesses.
Specializes in AI-driven solutions for businesses
Considered a leading tech startup in the industry
Known for innovative and cutting-edge technology
Has a strong focus on research and development
Provides services to a wide range of industries
- Q4. Question 4) Why do you want to join our company?
- Ans.
I want to join your company because of its innovative projects, strong company culture, and opportunities for growth.
Innovative projects that align with my interests and skills
Strong company culture that values collaboration and employee development
Opportunities for growth and advancement within the company
- Q5. Question 5) Tell me about your training and projects you have done in college?
- Ans.
I completed various training programs and projects during my college years, gaining hands-on experience in different areas.
Completed a training program in data analysis using Python and R
Developed a mobile application for a class project using Java and Android Studio
Participated in a research project on renewable energy sources
Completed an internship at a local software company, working on web development projects
Interview Preparation Tips
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 13 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
