Filter interviews by
Clear (1)
DSA and Arrays question
Implement a queue using two stacks
Use two stacks - one for enqueue operation and one for dequeue operation
For enqueue operation, push elements into the first stack
For dequeue operation, if the second stack is empty, pop all elements from the first stack and push into the second stack, then pop from the second stack
Example: Enqueue 1,2,3 -> Stack1: [1,2,3], Dequeue -> Stack2: [3,2,1], Dequeue -> 1
I applied via Campus Placement
Basic apt questions asked along with few quiz on various cs subjects
Top trending discussions
The program takes a string as input and capitalizes the first letter of each reversed word while keeping the rest of the letters in lowercase.
Split the input string into an array of words using the space as a delimiter
Iterate through each word in the array
Reverse the word and capitalize the first letter
Join the modified words back into a single string with spaces in between
I applied via Naukri.com and was interviewed in Oct 2023. There were 5 interview rounds.
I want to switch to SDET role to challenge myself, learn new skills, and contribute to the development of high-quality software.
I am motivated to switch to an SDET role because I enjoy problem-solving and have a passion for ensuring software quality.
Being an SDET allows me to work closely with developers, testers, and other stakeholders to create efficient and reliable software.
Learning is a key aspect of the SDET role...
Count consecutive characters in a string and return the count next to the character.
Iterate through the string and keep track of consecutive characters and their counts.
Use a dictionary to store the characters and their counts.
Return the characters and their counts in the desired format.
Find the second highest repeated integer in a list.
Iterate through the list and count the frequency of each integer.
Sort the frequencies in descending order and return the second highest frequency.
Handle edge cases like when there is no second highest frequency.
2 easy 1 medium coding questions
Linked list code for tasks
Create a linked list class
Implement add, remove, and search methods
Use the linked list to perform the tasks
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
2 Medium level DSA question
Use the exponentiation by squaring algorithm to optimally find n^m.
Use the exponentiation by squaring algorithm to reduce the number of multiplications needed.
Divide the exponent by 2 and recursively calculate the result.
Handle the cases when the exponent is even or odd separately.
Example: n^5 = n * n^2 * n^2
based on 3 interviews
Interview experience
based on 1 review
Rating in categories
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