i
PubMatic
Filter interviews by
Clear (1)
I applied via Approached by Company and was interviewed in Jul 2024. There was 1 interview round.
Count pairs in an array that sum up to a target value.
Iterate through the array and store the frequency of each element in a hashmap.
For each element, check if the difference between the target and the element exists in the hashmap.
Increment the count of pairs if the difference is found in the hashmap.
Binary search can be used to solve moderate problems of arrays that are first increasing and then decreasing.
Use binary search to find the peak element in the array, which marks the transition from increasing to decreasing.
Divide the array into two parts based on the peak element and apply binary search on each part separately.
Handle edge cases such as when the array is strictly increasing or strictly decreasing.
Exampl
Design a system for a web surfing utility
Use a web crawler to gather data from websites
Implement a search engine to retrieve relevant information
Utilize a recommendation system to suggest related content
Include user authentication and personalized settings
Ensure scalability and performance for handling large amounts of data
Find the smallest subarray in an array that has a given target sum.
Use a sliding window approach to find the subarray with the target sum.
Keep track of the current sum of elements in the window and adjust the window size accordingly.
Start with a window of size 1 and expand it until the sum is greater than or equal to the target sum.
Shrink the window from the left side while updating the smallest subarray length until t
Top trending discussions
I applied via Campus Placement
I am an avid traveler and have visited over 20 countries
I love experiencing new cultures and trying new foods
I have backpacked through Europe and Asia
I have volunteered in orphanages in Cambodia and Nepal
Mobile advertising platform
Adtech
Mobile marketing
App monetization
Maximum sub sequence sum in an array
Use Kadane's algorithm
Initialize max_so_far and max_ending_here to 0
Iterate through the array and update max_ending_here and max_so_far
Return max_so_far
Endianness refers to the byte order of a system. It determines how multi-byte data types are stored in memory.
Little-endian systems store the least significant byte first, while big-endian systems store the most significant byte first.
Endianness can affect the way data is transmitted between systems.
To determine the endianness of a system, you can use the byte order mark (BOM) or write a test program that checks the by...
Sort an array of 0's and 1's only.
Use two pointers, one at the beginning and one at the end of the array.
Swap 0's from the beginning with 1's from the end until the pointers meet.
Alternatively, use a counting sort algorithm to count the number of 0's and 1's and then reconstruct the array.
Heaps are data structures used to efficiently find the maximum or minimum element in a collection.
Max heap: parent nodes are always greater than or equal to child nodes
Min heap: parent nodes are always smaller than or equal to child nodes
Heaps are commonly used in priority queues and sorting algorithms
Heap operations include insert, delete, and extract max/min
Example: An array [3, 8, 2, 5, 1, 4, 6] can be represented a
Find 3 numbers in an array where a+b=c.
Loop through the array and check for all possible combinations of a and b.
Use a hash table to store the values of a and b, and check if c is present in the hash table.
Sort the array and use two pointers to find a and b, and then check if their sum equals c.
Algorithms for manipulating arrays and strings in coding
Use sorting algorithms like quicksort and mergesort for arrays
Use string manipulation functions like substring and replace for strings
Use dynamic programming for optimizing solutions to array and string problems
Designing a large scale Ad Server
Use distributed systems for scalability
Implement caching for faster ad delivery
Ensure high availability and fault tolerance
Use real-time bidding for efficient ad placement
Implement fraud detection mechanisms
Ensure compliance with privacy regulations
I applied via LinkedIn and was interviewed in Jan 2021. There were 5 interview rounds.
I applied via Naukri.com and was interviewed before May 2021. There were 4 interview rounds.
It was mixed like aptitude and from technical.
I applied via Campus Placement and was interviewed before Jul 2021. There were 3 interview rounds.
General aptitude test with math and logic related questions. there were also coding questions which were given more weightage than the other questions.
I applied via Campus Placement and was interviewed before Aug 2021. There were 4 interview rounds.
Coding cum aptitude test on Hackerrank
based on 1 interview
Interview experience
Softwaretest Engineer
102
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
80
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
72
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Software Engineer
47
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Engineer
27
salaries
| ₹0 L/yr - ₹0 L/yr |
InMobi
Komli Media
Adcolony
Affle