Coding questions
Browserstack Online Assessment
Overview
Here is how public prep guides and student write-ups describe the BrowserStack online assessment. This is not an official company brochure.
Machine-coding rounds that feel like building product utilities, not only LeetCode.
Usual selection rounds
Rounds students usually mention: Online assessment → Machine coding (often onsite) → Engineering Manager / Director rounds → HR (varies; some accounts list 4-6 rounds)
| Item | From student reports |
|---|---|
| Platform | Home OA / HackerEarth in some accounts |
| Online test summary | GFG Catapult: basic-medium MCQs on Web (HTML/CSS/JS), OS, CN, situational; ~300 sat, 30 shortlisted. Other fresher accounts: medium DSA OA then heavy machine coding. |
| Eligibility notes | Drive-specific |
| Branches (reported) | Software/Backend tracks |
Online test sections
| Section | Questions | Time | Notes |
|---|---|---|---|
| MCQ / DSA OA | 3 DSA in one 2025 account; MCQs in Catapult account | - | - |
Extra notes from sources
- Machine coding often allows internet; real product-flavoured tasks (e.g. tail -f log viewer).
Sample practice question styles
These are practice questions for speed - not claimed to be from a real BrowserStack live paper.
Coding Q1: Longest substring without repeating characters
Problem: Given a string s, find the length of the longest substring without repeating characters. Example: ‘abcabcbb’ → 3 (‘abc’).
Approach: Sliding window with a map (or last-seen index) of characters. Expand the right pointer; when a duplicate appears inside the window, move the left pointer past the previous occurrence.
Complexity: O(n) time
BrowserStack tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q2: Merge overlapping intervals
Problem: Given a list of intervals [start, end], merge all overlapping intervals and return the non-overlapping set that covers the same ranges.
Approach: Sort by start time. Walk once, merging into the last interval in the result when the next start is ≤ current end; otherwise append a new interval.
Complexity: O(n log n) time from the sort
BrowserStack tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q3: Top K frequent elements
Problem: Given an integer array and an integer k, return the k most frequent elements. Order among equals can be arbitrary unless the problem says otherwise.
Approach: Count frequencies with a hash map, then use a heap of size k (or bucket sort by frequency) to extract the top k keys.
Complexity: O(n log k) with a heap
BrowserStack tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q4: Linked list cycle
Problem: Given the head of a linked list, return true if there is a cycle and false otherwise.
Approach: Floyd’s tortoise and hare: move one pointer one step and another two steps. If they meet, a cycle exists. If the fast pointer hits null, there is no cycle.
Complexity: O(n) time, O(1) space
BrowserStack tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Prep tips from those student reports
- Practice timed machine coding with internet allowed
- Web + OS + CN basics for MCQ OA
- Be ready to demo working software
Sources
- BrowserStack Oncampus Placement Drive - GFG (gfg)
- BrowserStack Fresher Interview Experience 2025 - CodeHelping (other)
- BrowserStack fresher machine-coding selection process - PapersAdda (other)
These notes come from public reports and can differ by campus, year, and role. If your college placement email or the official careers/notification PDF says something different, follow that.
Comments & Suggestions
Related
Similar companies
Freshworks · Zoho · Atlassian