Busibud solutions pvt ltd interview experience Real time questions & tips from candidates to crack your interview

Fullstack Developer

Busibud solutions pvt ltd
upvote
share-icon
2 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 Months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
Tip
Tip

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Interview rounds

01
Round
Easy
Online Coding Test
Duration60 Minutes
Interview date1 Aug 2022
Coding problem3

Coding round

1. Find Number Of Islands

Moderate
34m average time
60% success
0/80
Asked in companies
MicrosoftAmazonUber

You are given a 2-dimensional array/list having N rows and M columns, which is filled with ones(1) and zeroes(0). 1 signifies land, and 0 signifies water.

A cell is said to be connected to another cell, if one cell lies immediately next to the other cell, in any of the eight directions (two vertical, two horizontal, and four diagonals).

A group of connected cells having value 1 is called an island. Your task is to find the number of such islands present in the matrix.

Try solving now

2. Star Pattern

Easy
10m average time
85% success
0/40
Asked in companies
PayPalInfo Edge India (Naukri.com)Blackrock
Pattern for N = 4

picture

The dots represent spaces.
Try solving now

3. Minimum Jumps

Moderate
25m average time
75% success
0/80
Asked in companies
WalmartDirectiMakeMyTrip

Bob lives with his wife in a city named Berland. Bob is a good husband, so he goes out with his wife every Friday to ‘Arcade’ mall.

‘Arcade’ is a very famous mall in Berland. It has a very unique transportation method between shops. Since the shops in the mall are laying in a straight line, you can jump on a very advanced trampoline from the shop i, and land in any shop between (i) to (i + Arr[i]), where Arr[i] is a constant given for each shop.

There are N shops in the mall, numbered from 0 to N-1. Bob's wife starts her shopping journey from shop 0 and ends it in shop N-1. As the mall is very crowded on Fridays, unfortunately, Bob gets lost from his wife. So he wants to know, what is the minimum number of trampoline jumps from shop 0 he has to make in order to reach shop N-1 and see his wife again. If it is impossible to reach the last shop, return -1.

Try solving now
02
Round
Easy
Video Call
Duration30 Minutes
Interview date3 Aug 2022
Coding problem1

Technical round very difficult.so we have to be honest otherwise they will terminate you

1. Technical Questions

It's based on your resume. They test what you presented in your resume
What are semaphores?

Problem approach

Tip 1 : Be prepared about your resume

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
Fullstack Developer
3 rounds | 2 problems
Interviewed by Busibud solutions pvt ltd
1307 views
1 comments
0 upvotes
Fullstack Developer
2 rounds | 2 problems
Interviewed by Busibud solutions pvt ltd
965 views
0 comments
0 upvotes
Fullstack Developer
1 rounds | 6 problems
Interviewed by Busibud solutions pvt ltd
1156 views
0 comments
0 upvotes
Fullstack Developer
2 rounds | 4 problems
Interviewed by Busibud solutions pvt ltd
1047 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Fullstack Developer
6 rounds | 5 problems
Interviewed by Microsoft
2223 views
0 comments
0 upvotes
company logo
Fullstack Developer
2 rounds | 2 problems
Interviewed by Samsung
2164 views
0 comments
0 upvotes
company logo
Fullstack Developer
2 rounds | 2 problems
Interviewed by Amdocs
1814 views
0 comments
0 upvotes