Filter interviews by
Clear (1)
1hr java and selenium
I applied via Approached by Company and was interviewed before Apr 2023. There were 2 interview rounds.
Coding on Data structures
Top trending discussions
I applied via Job Portal and was interviewed in Dec 2023. There were 3 interview rounds.
Easy question on python
Python is a popular choice for automation testing due to its simplicity, readability, extensive libraries, and cross-platform compatibility.
Python has a simple and readable syntax, making it easy to write and understand test scripts.
Python has a large number of libraries and frameworks specifically designed for automation testing, such as Selenium and PyTest.
Python is cross-platform compatible, allowing tests to be run...
Robot Framework is a powerful open-source automation framework that offers easy-to-use syntax and supports keyword-driven testing.
Robot Framework provides a simple and readable syntax, making it easy to write and maintain test cases.
It supports keyword-driven testing, allowing for high-level test case design and reusability.
Robot Framework has a rich ecosystem with a wide range of libraries and tools, making it highly ...
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 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 Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
100 minutes, there were 3 coding questions and some easy to medium level mcq on core subjects
A playlist can be implemented using an array of strings to store the list of songs.
Use an array of strings to store the list of songs in the playlist
Implement functions to add, remove, and shuffle songs in the playlist
Consider using a linked list data structure for more efficient insertion and deletion operations
DSA and lagorithmic optimizations (this is based on team you are joining so questions vary a LOT)
based on 3 interviews
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