BrowserStack Software Developer Intern Interview Questions, Process, and Tips

Round duration - 60 Minutes
Round difficulty - Easy

The platform was HackerEarth time duration was 1 hour.
2 Coding questions were asked, 30 minutes for each were allotted.

Q1. Longest Substring Without Repeating Characters
Given a string 'S' of length 'L', return the length of the longest substring without repeating characters.
Example:
Suppose given input is ...read more
Ans. Brute Force
In the brute force approach, we will use two nested loops. The outer loop is used to select the starting index of the substring and the inner loop is used to fix the ending index of the substring. After selecting the substring, we will use another loop (or a method) to check whether the substring contains all unique characters or not using a HashSet.
Space Complexity: O(n)Explanation:
O(L), where L is the len...read more
Answered by CodingNinjas
View 4 more answers
Q2. Triplets with Given Sum
You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.
An array is said t...read more
Ans. Brute Force
• The most trivial approach would be to find all triplets of the array and count all such triplets whose ‘SUM’ = 'K'.
• We can find the answer using three nested loops for three different indexes and check if the values at those indexes sum up to 'K'.
• Create a set  to keep the track of triplets we have visited. Run first loop from i = 0 to i = ‘N’ - 3, second loop from j = i + 1 to j = ‘N’ - 2 and third loop ...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 120 Minutes
Round difficulty - Hard

This was a 2 hours round, with the following problem statement. At the end of the allotted time you had give a demo and explain your implementation.

Q1. Application Question
This problem requires you to implement a log watching solution (similar to the tail -f command in UNIX). However, in this case, the log file is hosted on a remote machine (same machine ...read more
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

The platform was Zoom, time duration was 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms and real life problems.

Q1. Technical Questions
How did you find the last n lines of log file ? and if given more time how would you do it efficiently ?
Questions on a personal project and what if we do a change how will you handle it.
...read more
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy

Interviewer was very friendly. Asked few questions about myself and then asked questions about what I know about the company.

Q1. Basic HR Questions
How do you work under pressure?
Are you willing to relocate or travel?
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

The platform was HackerEarth time duration was 1 hour.
2 Coding questions were asked, 30 minutes for each were allotted.

Q1. Longest Substring Without Repeating Characters
Given a string 'S' of length 'L', return the length of the longest substring without repeating characters.
Example:
Suppose given input is ...read more
Ans. 
The problem asks to find the length of the longest substring without repeating characters in a given string.
• Use a sliding window approach to iterate through the string and keep track of the characters seen so far.

• Maintain a set to check for duplicate characters within the current substring.

• Update the maximum length of the substring whenever a duplicate character is encountered.

• Continue the process until the end of the ...read more
Answered by AI
View 4 more answers
Q2. Find All Triplets With Zero Sum
You are given an array Arr consisting of n integers, you need to find all the distinct triplets present in the array which adds up to zero.
An array is said to have a trip...read more
Ans. 
The task is to find all distinct triplets in an array that add up to zero.
• Iterate through the array and fix the first element of the triplet.

• Use two pointers approach to find the other two elements that sum up to the negative of the fixed element.

• Skip duplicate elements to avoid duplicate triplets.

• Return the list of triplets found.
Answered by AI
View 2 more answers

Round duration - 120 Minutes
Round difficulty - Hard

This was a 2 hours round, with the following problem statement. At the end of the allotted time you had give a demo and explain your implementation.

Q1. Designing Question
This problem requires you to implement a log watching solution (similar to the tail -f command in UNIX). However, in this case, the log file is hosted on a remote machine (same machine as...read more
Ans. 
Implement a log watching solution to stream updates from a remote log file to a web-based client in real-time.
• Create a server-side program that monitors the log file and streams updates to clients

• Use a web-based client that displays the updates in real-time without page refresh

• Implement server-side logic to push updates to clients without retransmitting the entire file

• Handle multiple clients simultaneously

• Load the web ...read more
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

The platform was Zoom, time duration was 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms and real life problems.

Q1. Technical Questions
How did you find the last n lines of log file ? and if given more time how would you do it efficiently ?
Questions on a personal project and what if we do a change how will you handle it.
...read more
Ans. 
Finding the last n lines of a log file and improving efficiency
• To find the last n lines of a log file, you can read the file line by line from the end and store the last n lines in a data structure.

• To improve efficiency, you can use a seek operation to directly jump to the end of the file and then read backwards.

• Another approach is to use a circular buffer to store the last n lines, continuously overwriting the oldest ...read more
Answered by AI
Add your answer