i
MiQ
Digital
Filter interviews by
Gradient Descent is an optimization algorithm used to minimize the error of a model by adjusting its parameters iteratively.
Gradient Descent is used in machine learning to find the optimal parameters for a model by minimizing a cost function.
It works by calculating the gradient of the cost function at a given point and moving in the opposite direction to reach the minimum.
There are different variations of Gradient Desc...
Top trending discussions
I applied via Recruitment Consulltant and was interviewed in Mar 2024. There were 3 interview rounds.
Epsilon offers cutting-edge technology, diverse projects, and a collaborative work environment.
Epsilon provides opportunities to work with advanced technology and tools in data science.
The company offers a wide range of projects across various industries, allowing for diverse and challenging work.
Epsilon fosters a collaborative work environment, encouraging teamwork and knowledge sharing among data scientists.
The compa...
I applied via Naukri.com and was interviewed before May 2023. There was 1 interview round.
posted on 16 Jan 2023
I applied via Naukri.com and was interviewed before Jan 2022. There were 3 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.
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
Optimize lift usage to reduce wait times for employees entering a 10-floor building.
Implement a smart scheduling system that prioritizes lifts based on the number of people waiting on each floor.
Introduce a destination dispatch system where employees select their floor before entering the lift, grouping them by destination.
Increase the number of lifts during peak hours or consider adding express lifts that service only...
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 LinkedIn and was interviewed in May 2021. There were 3 interview rounds.
based on 1 interview experience
based on 2 reviews
Rating in categories
Software Engineer
29
salaries
| ₹11 L/yr - ₹19.7 L/yr |
Data Analyst
26
salaries
| ₹4.2 L/yr - ₹13.1 L/yr |
Senior Software Engineer
24
salaries
| ₹23.6 L/yr - ₹31 L/yr |
Senior Analyst
22
salaries
| ₹13 L/yr - ₹21 L/yr |
Analyst
20
salaries
| ₹7 L/yr - ₹13.5 L/yr |
Epsilon
Denave
Smollan Group
ChannelPlay