Filter interviews by
Clear (1)
It was a DS and Algo round.
I was interviewed in Dec 2021.
Round duration - 90 minutes
Round difficulty - Medium
Time duration - 1.5 hour, (10 mins window to login for test)
No. of coding Question - 3 (2 medium, 1 hard)
You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...
The problem is to connect N ropes of different lengths into one rope with minimum cost.
Sort the array of rope lengths in ascending order.
Initialize a variable to keep track of the total cost.
While there are more than one rope remaining, take the two shortest ropes and connect them.
Add the cost of connecting the two ropes to the total cost.
Replace the two shortest ropes with the connected rope.
Repeat the above steps unt...
Round duration - 90 minutes
Round difficulty - Medium
Major Focus - Data structure, Algorithms, Competitive Programming
Point To Remember - All questions in this round were asked to explain, implement, explain and tell time and space complexity, optimise if possible
No. of candidates shortlisted - 26
Determine if a given graph is bipartite. A graph is bipartite if its vertices can be divided into two independent sets, 'U' and 'V', such that every edge ('u', 'v') conne...
The function checks whether a given graph is bipartite or not.
A bipartite graph can be divided into two independent sets such that every edge connects a vertex from one set to the other.
We can use graph coloring algorithm to check if the graph is bipartite.
Start by coloring the first vertex with one color and all its neighbors with the other color.
Continue coloring the remaining vertices, making sure that no adjacent v...
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...
The task is to find all the different possible substrings of size two that appear in a given string as contiguous substrings.
Iterate through the string and extract substrings of size two
Store the substrings in an array
Return the array of substrings
Given an undirected and disconnected graph G(V, E)
, where V
is the number of vertices and E
is the number of edges, the connections between vertices are provided in the 'GR...
The question asks to print the DFS traversal of an undirected and disconnected graph.
Implement a Depth First Search (DFS) algorithm to traverse the graph.
Use a visited array to keep track of visited vertices.
For each unvisited vertex, start a DFS traversal and print the connected component.
Sort the vertices of each connected component in ascending order before printing.
Tip 1 : have good hands on data structure and algorithms and competitive programming
Tip 2 : strong knowledge of core subjects of dbms, os and oops ( know less topic but in depth)
Tip 3 : your resume should speak about your skills and personality
Tip 1 : Know your resume - you are what you write in your resume
Tip 2 : should definately contain - Details, Education, Experience, Skills
Tip 3 : Additional Section - awards, certifications, publications, patents, volunteer work, extra curricular activities, hobbies
Tip 4 : Have a habit of tuning your resume according to the job profile
Tip 5 : Platform - flowcv.io
Top trending discussions
There are 2 sections one is Output guess and Another one is Quantitative
I didn't attend 2nd round..i was eliminated in 1st round
20 questions of aptitude
Hard
Very hard
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
based on 1 interview
Interview experience
based on 5 reviews
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