i
Whatfix
Filter interviews by
I was interviewed in Sep 2024.
The decision between wider or deeper neural networks depends on the complexity of the data and the trade-off between computational resources and performance.
Consider the complexity of the data: Deeper networks are better for more complex data, while wider networks are better for simpler data.
Evaluate computational resources: Deeper networks require more computational resources and training time compared to wider networ...
Data imbalance can be addressed by resampling techniques like oversampling, undersampling, or using algorithms like SMOTE.
Use oversampling to increase the number of minority class samples.
Use undersampling to decrease the number of majority class samples.
Utilize techniques like SMOTE (Synthetic Minority Over-sampling Technique) to generate synthetic samples for the minority class.
Consider using ensemble methods like Ra...
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
I applied via Company Website and was interviewed in Sep 2020. There were 5 interview rounds.
I applied via LinkedIn and was interviewed in Sep 2022. There were 3 interview rounds.
2 coding , 2 SQL with some quants
Remove redundant parentheses in a expression
Identify the innermost parentheses
Evaluate the expression inside the innermost parentheses
Replace the innermost parentheses with the evaluated expression
Repeat until no more redundant parentheses exist
A coding test on hackerrank with some basic graph problems
I applied via Naukri.com and was interviewed in Apr 2024. There were 2 interview rounds.
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
2 dsa questions and mcqs
based on 1 interview
Interview experience
Solution Engineer
46
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Manager
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Representative
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Manager
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer II
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Freshworks
Zoho
Druva
Postman