Filter interviews by
I applied via LinkedIn and was interviewed in Jul 2024. There were 3 interview rounds.
I am a highly experienced Programmatic Campaign Manager with a strong background in digital marketing and data analysis.
Over 5 years of experience in managing programmatic campaigns for various clients
Proficient in using DSPs, DMPs, and ad servers to optimize campaign performance
Skilled in analyzing campaign data to make data-driven decisions
Strong communication and project management skills
Previous experience working ...
I have implemented various optimizations including audience segmentation, bid adjustments, and ad creative testing.
Implemented audience segmentation to target specific groups of users more effectively
Made bid adjustments based on performance data to maximize ROI
Conducted ad creative testing to optimize messaging and visuals for better engagement
I managed an average of 10 campaigns simultaneously.
Managed up to 15 campaigns at once during peak periods
Prioritized tasks based on campaign goals and performance
Used project management tools to stay organized and efficient
Best practices for campaign optimizations include continuous monitoring, A/B testing, audience segmentation, and data analysis.
Continuous monitoring of campaign performance to identify trends and make real-time adjustments
Conducting A/B testing to compare different ad creatives, messaging, or targeting strategies
Segmenting audiences based on demographics, behaviors, or interests to deliver more personalized ads
Analyzin...
Experienced Category Manager with a background in retail and strong analytical skills.
Over 5 years of experience in category management
Skilled in data analysis and market research
Proven track record of increasing sales and profitability
Strong negotiation and vendor management skills
Previously managed categories such as electronics and home goods
I want to join Silverpush because of its innovative technology and strong reputation in the industry.
Innovative technology: I am excited about the opportunity to work with cutting-edge technology at Silverpush.
Strong reputation: Silverpush has a proven track record of success in the industry, and I want to be a part of that.
Career growth: I believe that joining Silverpush will provide me with opportunities for professi...
I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.
Previous Working details & case study
I applied via Referral and was interviewed in Jan 2024. There was 1 interview round.
Image processing is the analysis and manipulation of digital images to improve their quality or extract useful information.
Image enhancement: adjusting brightness, contrast, etc.
Image restoration: removing noise or blurring
Image segmentation: dividing an image into different regions
Object recognition: identifying objects in an image
Medical imaging: analyzing medical images for diagnosis
Silverpush interview questions for popular designations
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]
Top trending discussions
posted on 24 Mar 2015
Probability of a horse going out of a chessboard in 'n' steps.
The total number of possible moves for a horse is 8.
The probability of going out of the board depends on the position of the horse.
For example, if the horse is at a corner, the probability of going out of the board is higher.
The probability can be calculated using combinatorics and geometry.
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
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 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
based on 6 interviews
Interview experience
based on 32 reviews
Rating in categories
Associate Software Engineer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Product Manager
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
InMobi
Vizury
MoEngage
CleverTap