i
MoEngage
Filter interviews by
Be the first one to contribute and help others!
I applied via Job Portal and was interviewed in Apr 2021. There was 1 interview round.
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
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 applied via Referral
I applied via Campus Placement and was interviewed before May 2022. There were 3 interview rounds.
4 questions on Data Structure .
Online Mode
I applied via Job Portal and was interviewed in May 2024. There was 1 interview round.
I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.
I applied via Referral and was interviewed before Jan 2024. There were 4 interview rounds.
I have 5 years of experience working as a software engineer in a tech company.
Developed and maintained software applications for various platforms
Collaborated with cross-functional teams to deliver projects on time
Participated in code reviews and provided feedback for improvements
Implemented new features and enhancements based on client requirements
I handle challenges at work by breaking them down, seeking help when needed, and staying calm under pressure.
Break down the challenge into smaller tasks to make it more manageable
Seek help from colleagues or mentors if needed
Stay calm and focused under pressure to make rational decisions
Learn from past challenges to improve problem-solving skills
Senior Software Engineer
45
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Solution Engineer
37
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Customer Success Manager
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Manager
17
salaries
| ₹0 L/yr - ₹0 L/yr |
CleverTap
Netcore Cloud Private Limited
WebEngage
Vizury