Upload Button Icon Add office photos

Filter interviews by

Buyhatke Software Developer Intern Interview Questions and Answers

Updated 15 Sep 2021

Buyhatke Software Developer Intern Interview Experiences

1 interview found

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(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

  • Answered by AI
  • 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.

  • Answered by AI
  • 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 ...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from JAYPEE INSTITUTE OF INFORMATION TECHNOLOGY. I applied for the job as SDE - Intern in HyderabadEligibility criteriaAbove 7 CGPABuyhatke interview preparation:Topics to prepare for the interview - Data structures, Algorithms, Object-oriented programming, Database management system, Python, Machine Learning, web technologies, Problem-solvingTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview before Apr 2021.

Round 1 - Telephonic Call 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

It was in the mid day and since I applied for a Frontend role the discussion was majorly around data structure and bit of Javascript.
The interviewer was helping and good listener.

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.

    ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list without using additional space.

    • Create a dummy node to start the merged list

    • Compare the values of the two linked lists and add the smaller value to the merged list

    • Move the pointer of the merged list and the pointer of the smaller value list

    • Continue this process until one of the lists is fully traversed

    • Append the remaining elements of the other list to the me

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in linear time complexity.

    • Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

    • Swap elements based on the values encountered to sort the array in-place.

    • Time complexity should be O(N) and space complexity should be O(1).

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It was more of a in depth round on the framework I'm working on and problem solving.

  • Q1. What is the event loop and what is its significance?
  • Ans. 

    The event loop is a mechanism in programming that allows for asynchronous execution of code.

    • The event loop is a key component in JavaScript's runtime environment, responsible for handling asynchronous operations.

    • It continuously checks the call stack for any pending tasks and executes them in a non-blocking manner.

    • The event loop ensures that the program remains responsive by allowing other code to run while waiting for ...

  • Answered by AI
  • Q2. Can you provide examples of output-based questions in JavaScript that utilize browser APIs?
  • Ans. 

    Output-based questions in JavaScript using browser APIs

    • Example 1: Write a script that uses the Geolocation API to display the user's current location on a map

    • Example 2: Create a program that uses the Web Audio API to play a sound when a button is clicked

    • Example 3: Develop a web page that uses the Canvas API to draw a simple animation

  • Answered by AI
  • Q3. How would you design a system to support localization in a mobile app?
  • Ans. 

    Designing a system to support localization in a mobile app

    • Use resource files to store localized strings for different languages

    • Implement a language selection feature for users to choose their preferred language

    • Utilize localization libraries or frameworks to streamline the process

    • Consider cultural differences when localizing content, such as date formats and currency symbols

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 75 Minutes
Round difficulty - Hard

It was more of a fitment/managerial round.
Didn't had any coding questions, but was asked more on approaches and optimisations.
Discussions on the project you have worked on.

  • Q1. You need to find the fastest 3 horses out of a group, given that you can only race 5 horses at a time. How would you approach this problem?
  • Ans. 

    To find the fastest 3 horses out of a group with 5 horses racing at a time, we can use a tournament style approach.

    • Divide the horses into groups of 5 and race them against each other. This will give you the fastest horse in each group.

    • Take the winners from each group and race them against each other. The top 3 horses in this final race will be the fastest 3 overall.

    • Keep track of the results and compare the timings to d

  • Answered by AI
  • Q2. How do you debug the root cause of lag on a screen?
  • Ans. 

    To debug lag on a screen, analyze code, check for memory leaks, optimize rendering, and use profiling tools.

    • Analyze code to identify any inefficient algorithms or operations causing lag.

    • Check for memory leaks that could be impacting performance.

    • Optimize rendering by reducing the number of draw calls, optimizing shaders, and minimizing overdraw.

    • Use profiling tools like Xcode Instruments or Android Profiler to identify p

  • Answered by AI
  • Q3. Can you explain the architecture of the app you have recently worked on?
  • Ans. 

    The app I recently worked on is a social media platform for sharing photos and connecting with friends.

    • The app follows a client-server architecture, with the client being the mobile app and the server handling data storage and processing.

    • The client side is built using React Native for cross-platform compatibility.

    • The server side is implemented using Node.js with a MongoDB database for storing user data and photos.

    • The a...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaNo criteriaCars24 interview preparation:Topics to prepare for the interview - Data Structures Algorithms, Javascript, System DesignTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Get your JS fundamentals right (if applying for a Frontend role, https://javascript.info/ is a good start)
Tip 2 : Apart from preparing data structures, practise on the communication skills as well (prepare your introduction, be a good listener and on spot improvisation plays key roles)

Application resume tips for other job seekers

Tip 1 : highlight projects related to the job profile in your resume and mention what was your contribution in them precisely in 1/2 lines.
Tip 2 : Include URLs to applications/projects that you have build and your achievements/blog (if any)

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
2
Poor
Difficulty level
Easy
Process Duration
4-6 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Nov 2023. There was 1 interview round.

Round 1 - Coding Test 

Easy and medium level questions on array linked list

Interview Preparation Tips

Interview preparation tips for other job seekers - dont waste time on this one
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed in Mar 2024. There were 3 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Js question with code snippets
Round 2 - Coding Test 

Given some ant ui design to reacreate from scretch

Round 3 - One-on-one 

(1 Question)

  • Q1. Asked system design for online movie booking plateform
Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I appeared for an interview in Feb 2025.

Round 1 - Aptitude Test 

Data Structures, Coding MCQs

Round 2 - Technical 

(2 Questions)

  • Q1. What is Data Structure
  • Ans. 

    Data structures are organized formats for storing, managing, and accessing data efficiently.

    • 1. Types: Common data structures include arrays, linked lists, stacks, queues, trees, and graphs.

    • 2. Arrays: Fixed-size collections of elements, e.g., [1, 2, 3, 4].

    • 3. Linked Lists: Collections of nodes where each node points to the next, e.g., 1 -> 2 -> 3.

    • 4. Stacks: Last-in, first-out (LIFO) structures, e.g., function call ...

  • Answered by AI
  • Q2. Write DFS Algorithm
  • Ans. 

    Depth-First Search (DFS) is a graph traversal algorithm that explores as far as possible along each branch before backtracking.

    • DFS uses a stack data structure, either explicitly or via recursion.

    • It starts from a selected node and explores each branch before backtracking.

    • Example: In a binary tree, DFS can be implemented using pre-order, in-order, or post-order traversal.

    • DFS can be used to find connected components in a ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Familiar in Data Structures and Algorithms
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
6-8 weeks
Result
No response

I applied via Campus Placement and was interviewed in Jan 2024. There were 4 interview rounds.

Round 1 - Coding Test 

Easy to medium level of leet code

Round 2 - Technical 

(1 Question)

  • Q1. 1. Fibonacci series with recursion and without recursion 2. String Palindrome 3. Count all repeated numbers from the array
  • Ans. 

    Answering questions related to Fibonacci series, string palindrome, and counting repeated numbers in an array.

    • For Fibonacci series with recursion, write a function that calls itself to calculate the next number in the series.

    • For Fibonacci series without recursion, use a loop to calculate the series.

    • For string palindrome, compare characters from start and end of the string.

    • To count all repeated numbers from the array, u

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. 1.Given an array(0-based indexing), you have to find the max sum of i*A[i] where A[i] is the element at index i in the array. The only operation allowed is to rotate(clock-wise or counter clock-wise) the ...
  • Ans. 

    Rotate array to find max sum of i*A[i]

    • Rotate array to bring maximum element to front

    • Calculate sum of i*A[i] for each rotation

    • Keep track of maximum sum found

  • Answered by AI
Round 4 - HR 

(1 Question)

  • Q1. 1.Oops concepts 2.Oops code 2.About Java Spring 3. Array stack questions 4.Project discussion

Interview Preparation Tips

Interview preparation tips for other job seekers - Solve leet code question, clear concept of DSA.

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Sep 2023. There was 1 interview round.

Round 1 - Coding Test 

3 Questions were asked out of which if you did 2 you were shortlisted for next round. Questions were mostly from topics like array, string and greedy

Interview Preparation Tips

Interview preparation tips for other job seekers - There were 3 rounds after the initial round, 1st round asked 2 questions, one was based on sorting an array in a way that an element would always have it's left element smaller than itself and right element always greater than itself. Second question was a bit lengthy where I was given a linked list question. Next round i was asked 2 questions both based on greedy problems and final round was the interview where they would test your knowledge to the depths. Advanced questions on OOP, System Architecture, Database Management System and Research Work was focused on.
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Majorily on SQL and Databases

Round 2 - Technical 

(2 Questions)

  • Q1. Align two images in a page with same width and same height
  • Ans. 

    Use CSS to align two images with same width and height on a page

    • Set both images to have the same width and height using CSS

    • Use flexbox or grid layout to align the images horizontally or vertically

    • Adjust margins or padding to fine-tune the alignment

  • Answered by AI
  • Q2. Array related question
Round 3 - HR 

(2 Questions)

  • Q1. Situation based question
  • Q2. Majorily focused on project

Skills evaluated in this interview

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Create pagination component using an api show the data for the pages
  • Ans. 

    Create a pagination component using an API to display data for different pages.

    • Use API to fetch data for each page

    • Implement pagination logic to display data for each page

    • Allow users to navigate between pages

  • Answered by AI

Skills evaluated in this interview

Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

In test I had to solve 3 dsa questions in 1 hour

Round 2 - Technical 

(1 Question)

  • Q1. I have asked 2 DSA questions in my interview

Tell us how to improve this page.

Buyhatke Software Developer Intern Reviews and Ratings

based on 1 review

3.0/5

Rating in categories

2.0

Skill development

5.0

Work-life balance

3.0

Salary

3.0

Job security

1.0

Company culture

3.0

Promotions

2.0

Work satisfaction

Explore 1 Review and Rating
Software Developer
8 salaries
unlock blur

₹11 L/yr - ₹15.8 L/yr

Software Development Engineer
5 salaries
unlock blur

₹10 L/yr - ₹16 L/yr

Product Designer
5 salaries
unlock blur

₹5.4 L/yr - ₹12 L/yr

Content Developer
4 salaries
unlock blur

₹5.5 L/yr - ₹13 L/yr

Business Development Manager
4 salaries
unlock blur

₹7 L/yr - ₹7 L/yr

Explore more salaries
Compare Buyhatke with

Udaan

3.9
Compare

Swiggy

3.8
Compare

CARS24

3.5
Compare

BlackBuck

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview