Filter interviews by
posted on 26 Apr 2024
I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.
Real Time Framework is a testing framework used for automation testing of real-time applications.
Real Time Framework is designed specifically for testing real-time applications.
It allows for automation testing of applications that require real-time data processing.
The framework provides tools and features to simulate real-time scenarios and test the application's response.
It helps in identifying performance issues and ...
A Java program that demonstrates string recursion.
Create a method that takes a string as input and recursively calls itself to manipulate the string.
Use base case to stop the recursion.
Example: public static String reverseString(String str) { if (str.isEmpty()) { return str; } else { return reverseString(str.substring(1)) + str.charAt(0); } }
Bug Life Cycle is the process of a bug from identification to resolution in software testing.
Bug is identified by tester
Bug is reported in bug tracking tool
Bug is assigned to developer
Developer fixes the bug
Bug is re-tested by tester
Bug is closed if fixed or reopened if not
Methods in Selenium are actions that can be performed on web elements to automate testing.
findElement() - Locates a single web element on the page
findElements() - Locates multiple web elements on the page
sendKeys() - Enters text into an input field
click() - Clicks on a web element
getText() - Retrieves the text of a web element
Encapsulation, Inheritance, Polymorphism, and Abstraction are the OOP concepts used in Selenium framework.
Encapsulation: Used to hide the internal implementation details of the classes. For example, using private variables and methods to restrict access.
Inheritance: Allows classes to inherit properties and behavior from other classes. For example, creating a base test class with common methods and properties.
Polymorphi...
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.
I was interviewed before Jun 2016.
I prefer Python because of its simplicity, readability, and extensive libraries.
Python is known for its simplicity and readability, making it easier to write and understand code.
Python has a large number of libraries and frameworks that can be used to quickly develop applications.
Python's syntax is clean and concise, allowing for faster development and easier maintenance.
Python is widely used in various domains such as...
I want to work with Pubmatic because of their innovative technology solutions and strong reputation in the industry.
Pubmatic is known for their cutting-edge technology solutions in the digital advertising space
I admire Pubmatic's strong reputation and track record in the industry
I believe working at Pubmatic will provide me with valuable learning opportunities and career growth
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 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 Approached by Company and was interviewed in Apr 2024. There were 2 interview rounds.
To develop a highly scalable API of an advertising campaign
I applied via LinkedIn and was interviewed before May 2022. There were 2 interview rounds.
Python dictionary is implemented using hash tables.
Python dictionary is a collection of key-value pairs.
The keys in a dictionary must be unique and immutable.
The values in a dictionary can be of any data type.
Python dictionary is implemented using hash tables.
Hash tables provide constant time complexity for insertion, deletion and retrieval of elements.
The hash function used in Python dictionary is based on the key's h...
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
It divides the input into a sorted and an unsorted region.
It repeatedly extracts the maximum element from the unsorted region and inserts it into the sorted region.
It has a time complexity of O(n log n) and is not stable.
Example: [8, 5, 3, 1, 9, 6, 0, 7, 4, 2] -> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
based on 1 interview
Interview experience
Data Analyst
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Support Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
InMobi
Affle
Komli Media
PubMatic