Filter interviews by
Clear (1)
posted on 1 Apr 2021
I applied via Naukri.com and was interviewed in Mar 2021. There was 1 interview round.
Find triplet in an array to sum up to a given number.
Sort the array in ascending order.
Iterate through the array and fix the first element.
Use two pointers approach to find the other two elements that sum up to the given number.
Printing a star pattern using loops in programming.
Use nested loops to print the pattern
The outer loop controls the number of rows
The inner loop controls the number of stars to be printed in each row
Use string concatenation to build the pattern
Example: for a pattern with 5 rows, the first row will have 1 star, the second row will have 2 stars, and so on
SQL query to find aggregate salary for a division
Use the GROUP BY clause to group the employees by division
Use the SUM function to calculate the total salary for each division
Include the division column in the SELECT statement
Example: SELECT division, SUM(salary) AS total_salary FROM employees GROUP BY division
Abstract class is a class that can have both abstract and non-abstract methods while Interface only has abstract methods.
Abstract class can have constructors while Interface cannot.
A class can implement multiple interfaces but can only inherit from one abstract class.
Abstract class can have instance variables while Interface cannot.
Abstract class can provide default implementation for some methods while Interface canno...
Top trending discussions
posted on 19 Nov 2022
I applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.
Strings, Arrays, OOPS, Data structures
Find the max element in the array
Iterate through the array and compare each element with a variable storing the current max value
Use built-in functions like Math.max() or spread operator to find the max value
Consider edge cases like empty array or array with negative values
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
The edit distance problem involves finding the minimum number of operations required to transform one string into another.
The edit distance problem can be solved using dynamic programming.
Common operations include insertion, deletion, and substitution of characters.
Example: Given strings 'kitten' and 'sitting', the edit distance is 3 (substitute 'k' with 's', insert 'g', substitute 'n' with 'g').
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 Company Website and was interviewed in Sep 2020. There were 5 interview rounds.
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