BrowserStack interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

BrowserStack
upvote
share-icon
2 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Journey
I Had some coding knowledge when i Joined college. Then was not working that till my 2 year but after 2 year i worked a lot on my coding skills. I Got an many offers and finally decided to join cisco as an intern in my 4 year after that got a PPO and have started working full time there.
Application story
There was an opening in BrowserStack for 2022 graduates. i applied with referral , got the test link,eared the test but was not able to clear technical interviews.
Why selected/rejected for the role?
Rejected, interviews were pretty tough and required extensive knowledge of computer fundamentals and i was not prepared for it.
Preparation
Duration: 4 Months
Topics: Data Structures, Algorithms, DBMS, OOPS, Operating System
Tip
Tip

Tip 1 : Must do Previously asked Interviews as well as Online Test Questions.
Tip 2 : Must have good knowledge of DSA
Tip 3 : Do at least 2 good projects and you must know every bit of them.

Application process
Where: Referral
Eligibility: No criteria
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
Medium
Online Coding Test
Duration120 Minutes
Interview date7 May 2022
Coding problem3

This round had 3 medium-level DSA problems.

1. Spiral Matrix

Easy
15m average time
80% success
0/40
Asked in companies
JP MorganSalesforceApple

You are given a 2-D array 'MATRIX' of dimensions N x M, of integers. You need to return the spiral path of the matrix.

Example Of Spiral Path:

Spiral path of a matrix

Try solving now

2. Check If Given Words Are Present In A String

Hard
35m average time
60% success
0/120
Asked in companies
InfosysMicrosoftAmazon

Given a string 'S' and a list 'wordList' that consists of 'N' distinct words. Let 'Wi' denote word at index 'i' in 'wordList'. For each word 'Wi' in 'wordList', you need to determine whether it is present in string 'S' or not. Return a boolean array, where a boolean value at index ‘i’ represents whether the word ‘Wi’ is present in the string ‘S’ or not.

Try solving now

3. Highway BillBoards

Moderate
0/80
Asked in companies
Expedia GroupFlipkartBrowserStack

You have to place ‘N’ billboards across a highway of ‘M’ kilometres. All the possible sites to place a billboard is given in the ‘billboards’ array. The revenue earned by placing a billboard is described by the ‘revenue’ array, billboard at ‘billboard[i]’ will earn the revenue equal to ‘revenue[i]’. There is a condition that no two billboards can be placed within ‘X’ kilometres of each other.

For Example :
You are given billboards = [2, 8, 9, 10, 15], revenue = [20, 50, 10, 30, 5], ‘M’ = ‘20’, ‘X’ = 5, here we can place the billboard at positions 2, 8, 15, which will give the profit as 20 + 50 + 5 = 75. Hence the answer is 75.
Problem approach

Let maxRev[i], 1 <= i <= M, be the maximum revenue generated from beginning to i miles on the highway. Now for each mile on the highway, we need to check whether this mile has the option for any billboard, if not then the maximum revenue generated till that mile would be same as maximum revenue generated till one mile before. But if that mile has the option for billboard then we have 2 options: 
1. Either we will place the billboard, ignore the billboard in previous t miles, and add the revenue of the billboard placed. 
2. Ignore this billboard. So maxRev[i] = max(maxRev[i-t-1] + revenue[i], maxRev[i-1])

Try solving now
02
Round
Hard
Video Call
Duration60 Minutes
Interview date29 Apr 2022
Coding problem1

This was a machine coding round where an problem statement was given. after time ends you had to give a demo and explain your implementation.

1. Machine Coding Question

Build a small knowledge base about the top N movies listed on IMDb Charts and provide a mechanism to query the same.
Your program should accept N as an input parameter and do the following:
Fetch the list of top N movies from the IMDb website and build an in-memory knowledge base comprising of
the names of the movies
the names of the cast of each movie
This should be built at runtime and stored in a suitable data structure of your choice.
Provide a query interface (command line would do) to query this knowledge base by actor’s name. For a given actor and a number M (< N), it should return the top M movies they have acted in.
external API for fetching movies from IMDb was not allowed.

For example, if N=3, then the program should parse the first 3 movies’ individual pages from IMDb Charts and build the knowledge base of the cast (there are about 15-20 names per page). Upon querying for “Morgan Freeman” and M=1, the answer is “The Shawshank Redemption”.

Problem approach

Tip 1 : Practice these questions well for interview
Tip 2 : Most of the questions are on same pattern as previously asked in the interview
Tip 3 : Keep the interviewer engaged.

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 the purpose of the < title > tag in HTML?

Choose another skill to practice
Similar interview experiences
SDE - Intern
4 rounds | 5 problems
Interviewed by BrowserStack
2763 views
0 comments
0 upvotes
SDE - 1
5 rounds | 5 problems
Interviewed by BrowserStack
3699 views
0 comments
0 upvotes
Customer Engineer
2 rounds | 9 problems
Interviewed by BrowserStack
964 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by BrowserStack
2455 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
110561 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
54361 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
33289 views
6 comments
0 upvotes