PubMatic | Intern+FTE | Pune | April 2022
Summary
I applied for an Intern/FTE role at PubMatic in Pune, undergoing a multi-stage interview process including a screening round, two technical rounds focusing on data structures and algorithms, and a final HR round, ultimately leading to an offer.
Full Experience
I applied for the Intern + FTE role at PubMatic through a job opening link I found in a Telegram group that regularly posts about job opportunities. The initial stage was a Screening Round, which comprised three coding questions along with multiple-choice questions on C/C++.
After successfully clearing the screening round, I progressed to the interview phase. This consisted of two technical rounds and a subsequent HR round. Both technical rounds were conducted on the same day, each lasting approximately 90-95 minutes.
Round 1
During this round, I was first asked to explain the internal implementation of a Min Heap data structure and then tasked with coding it from scratch. Following that, I was given a problem to implement Pascal's triangle.
Round 2
This round also spanned about 90-95 minutes. The core problem statement was: "Suppose we are given an incoming list of billions of names. The objective is to determine the frequency of each name and then sort these names in ascending order of their frequencies. A crucial constraint was that the use of the Standard Template Library (STL) was strictly prohibited (I was using C++ for my solution). This question also incorporated OOPS-based concepts alongside the implementation."
A few days after completing the technical rounds, I was informed about the results and then proceeded to the final HR round.
Interview Questions (2)
Implement a function to generate Pascal's triangle up to a given number of rows.
Given an incoming stream or list containing billions of names, determine the frequency of each name and then sort the names in ascending order based on their frequencies. The use of Standard Template Library (STL) is not permitted. This question involved OOPS concepts and custom implementation.