Filter interviews by
Top trending discussions
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.
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 Company Website and was interviewed in Sep 2020. There were 5 interview rounds.
Leetcode easy-medium
Cyber security is the practice of protecting systems, networks, and data from digital attacks.
Cyber security involves implementing measures to prevent unauthorized access, data breaches, and other cyber threats.
It includes technologies, processes, and practices designed to protect networks, devices, programs, and data from attack, damage, or unauthorized access.
Examples of cyber security measures include firewalls, ant...
Types of encryption include symmetric encryption, asymmetric encryption, and hashing.
Symmetric encryption: Uses the same key for both encryption and decryption, examples include AES and DES.
Asymmetric encryption: Uses a pair of public and private keys for encryption and decryption, examples include RSA and ECC.
Hashing: Converts data into a fixed-size string of bytes, examples include MD5 and SHA.
I applied via Campus Placement and was interviewed before Sep 2023. There were 3 interview rounds.
2 coding questions were asked followed by an English test
I applied via Campus Placement
40 Aptitude Questions, one English test, 2 Easy Programming questions
Coding Round one. A string question
A String Question - Intermediate
I applied via Company Website and was interviewed in Jan 2022. There were 5 interview rounds.
- 30 MCQ questions mostly related to HTML, JS & C#
- 2 easy-moderate coding questions
- Aptitude test on CoCubes (12 mins)
- English Test (speaking + writing + reading + listening) on Pearson platform
Find the length of longest substring composed of same digit within a string of digits.
Iterate through the string and keep track of the current digit and its count
Update the maximum count whenever a new digit is encountered
Return the maximum count
To debug the slow behavior of the API, analyze network latency, check for database issues, monitor server performance, and review code for potential bottlenecks.
Analyze network latency to identify any issues with data transmission.
Check for database issues such as slow queries or insufficient indexing.
Monitor server performance to ensure it has enough resources and is not overloaded.
Review the code for potential bottle...
Find maximum and second maximum number in an array without using sort and single loop.
Initialize max and secondMax variables to the smallest possible integer value
Iterate through the array and update max and secondMax accordingly
Return max and secondMax as the result
based on 1 interview
Interview experience
Software Engineer
106
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
81
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
43
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Software Engineer
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Solution Engineer
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Freshworks
Zoho
Chargebee
MindTickle