Filter interviews by
I applied via Approached by Company and was interviewed in Aug 2024. There was 1 interview round.
Data pipeline implementation involves extracting, transforming, and loading data for analysis and storage.
Identify data sources and requirements
Extract data from sources using tools like Apache NiFi or Talend
Transform data using tools like Apache Spark or Python scripts
Load data into storage systems like Hadoop or AWS S3
Monitor and optimize pipeline performance
Creating a Flutter app involves designing the UI, writing code in Dart, and testing on various devices.
Design the user interface using Flutter widgets
Write code in Dart programming language
Test the app on different devices and screen sizes
Use packages and plugins for additional functionality
Optimize performance for smooth user experience
Kind of a screening round with a medium level DSA problem
One pure coding round
I applied via LinkedIn and was interviewed in Jan 2024. There were 5 interview rounds.
Highspot interview questions for popular designations
I applied via LinkedIn and was interviewed in Aug 2023. There were 2 interview rounds.
GitOps is better than normal strategy as it allows for declarative configuration, version control, automated workflows, and easier collaboration.
Declarative configuration: GitOps uses declarative configuration stored in Git repositories, making it easier to manage and track changes.
Version control: GitOps leverages Git's version control capabilities to track changes, rollback to previous versions, and ensure consistenc...
Pull based and push based are two different methods of data transfer in computing.
Pull based: Data is requested by the receiver when needed. Examples include HTTP GET requests and polling.
Push based: Data is sent by the sender without the receiver requesting it. Examples include notifications and real-time data streams.
Updating manifests or deployments using ArgoCD involves making changes to the Git repository and letting ArgoCD automatically sync the changes to the cluster.
Make necessary changes to the manifests in the Git repository.
Commit and push the changes to the repository.
ArgoCD will automatically detect the changes and sync them to the cluster.
Monitor the sync process and ensure that the deployment is successful.
Top trending discussions
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 7 interviews
Interview experience
Software Development Engineer II
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Support Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineering Manager
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Engineering Manager
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Freshworks
Zoho
MindTickle
Druva