Faster and better experience!
Filter interviews by
Top trending discussions
I applied via Approached by Company and was interviewed before Feb 2022. There were 4 interview rounds.
It can be related to a scenario which might be related to an organization who is looking to move into digital domain to sell their products, ask will be create a roadmap, program plan, proposed technology stack and budgeting.
I applied via Job Portal and was interviewed in Oct 2021. There was 1 interview round.
I encourage open communication and collaboration to resolve conflicts and find mutually beneficial solutions.
Encourage open communication and active listening
Identify the root cause of the conflict
Brainstorm potential solutions together
Find a mutually beneficial solution
Document the resolution and follow up to ensure success
I appeared for an interview in Feb 2023.
posted on 14 Jul 2022
I applied via Job Portal and was interviewed in Jun 2022. There were 2 interview rounds.
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.
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
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
based on 4 reviews
Rating in categories
Assistant Manager
58
salaries
| ₹5.5 L/yr - ₹12 L/yr |
Group Head
43
salaries
| ₹11 L/yr - ₹22.5 L/yr |
Senior Executive
41
salaries
| ₹4.8 L/yr - ₹8 L/yr |
Senior Manager
37
salaries
| ₹7.8 L/yr - ₹17 L/yr |
Associate Head Group
25
salaries
| ₹10 L/yr - ₹16.5 L/yr |
Epsilon
Denave
Smollan Group
ChannelPlay