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

Web Developer

Busibud solutions pvt ltd
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 4 Months
Topics: Data Structure and Algorithm, Pointers, OOPS, System Design
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
Duration100 minutes
Interview date2 Jan 2023
Coding problem3

Purely coding round

1. Pair Sum

Easy
15m average time
90% success
0/40
Asked in companies
SalesforceUberPayU

You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair equals 'S'.

Note:

Each pair should be sorted i.e the first value should be less than or equals to the second value. 

Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
Problem approach

2 pointer approach

Try solving now

2. N Queens

Hard
55m average time
35% success
0/120
Asked in companies
Thought WorksTwitterAdobe

You are given an integer 'N'. For a given 'N' x 'N' chessboard, find a way to place 'N' queens such that no queen can attack any other queen on the chessboard.

A queen can be killed when it lies in the same row, or same column, or the same diagonal of any of the other queens. You have to print all such configurations.

Problem approach

N Queens

Try solving now

3. Find Palindromes

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

You are given an integer ‘N’. Your task is to find all palindromic numbers from 1 to ‘N’.

Palindromic integers are those integers that read the same backward or forwards.

Note:
Order of numbers should be in the non-decreasing matter.
For example:
You are given ‘N’ as 12, so the output should be [1, 2, 3, 4, 5, 6, 7, 8, 9, 11], as all single-digit numbers are palindromic, and 11 is also a palindromic number.
Problem approach

easy

Try solving now
02
Round
Easy
HR Round
Duration10 Minutes
Interview date3 Jan 2023
Coding problem1

Basic HR Round

1. Basic HR Questions

Tell me about yourself, Education Background, Internship (Optional if u haven't done), salary expectations, willing to relocate, family members, Projects done in college, Email, GitHub Profile

Problem approach

Tip 1 : Confidence in HR round

03
Round
Easy
Video Call
Duration30 Minutes
Interview date5 Jan 2023
Coding problem1

It was a technical round

1. Technical Questions

Based On your resume, will ask about every language, Tech Skill mention in your resume, Projects Uploaded on Github

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
Web Developer
2 rounds | 2 problems
Interviewed by Busibud solutions pvt ltd
921 views
0 comments
0 upvotes
Fullstack Developer
1 rounds | 6 problems
Interviewed by Busibud solutions pvt ltd
1156 views
0 comments
0 upvotes
Java Developer
2 rounds | 2 problems
Interviewed by Busibud solutions pvt ltd
1205 views
0 comments
0 upvotes
Fullstack Developer
2 rounds | 4 problems
Interviewed by Busibud solutions pvt ltd
1047 views
0 comments
0 upvotes