Faster and better experience!
Filter interviews by
I applied via LinkedIn and was interviewed in Jun 2024. There were 2 interview rounds.
Strategies leetcode,pandas,
Code for rand7 using rand5 function
Use rand5 twice to generate a number in [1,25] with equal probability
If the number is greater than 21, discard and try again
Otherwise, return (number mod 7) + 1
LRU cache is implemented using a doubly linked list and a hash map.
Create a doubly linked list to keep track of the order of elements in the cache.
Create a hash map to store the key-value pairs of the cache.
When a new element is added, check if the cache is full. If it is, remove the least recently used element from the linked list and the hash map.
When an element is accessed, move it to the front of the linked list to...
Function to randomly select pivot element in Quick Sort
Generate a random index within the range of the array
Return the element at the randomly generated index as the pivot
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
The interviewer called my via phone and simultaneously provided me a link where I had to write the code for a given problem. It was scheduled at 12:30 pm, so timing was not an issue. It was a standard DP question involving a 2D matrix. The question was easy and I was able to code it within given time.
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me two coding questions in this round.
Efficient program to find sum of largest contiguous subarray within a one-dimensional array.
Use Kadane's algorithm to find the maximum sum subarray in O(n) time complexity.
Initialize max_sum and current_sum to 0, iterate through array updating current_sum and max_sum.
Return max_sum as the result.
Round duration - 60 minutes
Round difficulty - Easy
This was on-site round at their Bangalore office. The interviewer was friendly and helpful. The interview held inside a conference room.
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...
DFS traversal problem to find connected components in an undirected and disconnected graph.
Use Depth First Search (DFS) algorithm to traverse the graph and find connected components
Maintain a visited array to keep track of visited vertices
Iterate through all vertices and perform DFS on unvisited vertices to find connected components
Round duration - 60 minutes
Round difficulty - Easy
This was the next round of the onsite interviews. Took place in the same conference room as that of the previous round.
Round duration - 60 minutes
Round difficulty - Easy
This was the third round of the onsite interview.
Practice DP based questions as much as you can. Also, be confident during the interview about your solution. For practice, you can prefer Coding Ninjas and Geeks For Geeks.
Application resume tips for other job seekersKeep it short. Mention the academic and professional projects you've done. Add your educational details properly with percentage or CGPA obtained.
Final outcome of the interviewSelectedI appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
The test was scheduled around 5 evening and it had 3 coding questions. First question was on Dynamic Programming and other was medium question and was easy and the third was based on graph. And there were 20 mcq questions on Data structures, DBMS and OS
Explanation: You are given an 'M' x 'N' matrix of characters named CHARACTER_MATRIX
and a string WORD
. Your task is to identify and list all the occurrences of the string within...
Matrix Word Search Problem - Find occurrences of a given word in all eight possible directions within a matrix.
Iterate through each cell in the matrix and check for the starting character of the word.
For each occurrence of the starting character, check all eight directions for the complete word.
Keep track of the coordinates of each character in the word for each occurrence found.
Ensure boundaries are not crossed while ...
Round duration - 60 minutes
Round difficulty - Easy
Normal Coding question on Graphs and some basics from DBMS
Given a directed graph with 'V' vertices and 'E' edges, determine if a vertex i
is reachable from vertex j
for all pairs of vertices (i, j)
. A vertex...
Determine reachability between all pairs of vertices in a directed graph.
Use Floyd Warshall algorithm to find transitive closure of the graph.
Initialize a V x V matrix with 1s on the diagonal and 0s elsewhere.
Update matrix by checking if there is a path from i to j through k.
Repeat the process for all vertices to get the transitive closure matrix.
Round duration - 60 minutes
Round difficulty - Hard
He asked me to read about Morse language in wikepedia and asked me to write a code on it i. e. If the input Morse code and in output we should get it in English
You are provided with a string of morse code(s) of length N. Your task is to convert this morse code into the corresponding alphanumeric code consisting of lowercas...
Convert Morse code to alphanumeric code using a predefined table.
Iterate through the morse code string and convert each morse code to its corresponding alphanumeric character using the given table.
Join the converted characters to form the final alphanumeric string.
Handle spaces between morse code characters by adding a space in the final alphanumeric string.
Tip 1 : Do all the questions of interview bit atleast twice for those who are not good in coding much. And simultaneously do mcqs from geeks for geeks especially from the topics Data structures, DBMS and Operating system
Tip 2 : Do go through all the dynamic programming questions from geeks for geeks.
Tip 3 : Practice lot of questions from leetcode.
Tip 1 : Always keep your resume short
Tip 2 :Try to keep it on one page . And never put false things on resume and write only those topics that you have thorough knowledge
I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.
1 dp
2 dynamic graph
I applied via Job Fair and was interviewed in Oct 2024. There was 1 interview round.
Prepare well for machine coding rounds.
I applied via Campus Placement and was interviewed in Nov 2024. There were 3 interview rounds.
The DSA round happens with pseudo code
I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.
OA was about dp and graph
Was about dp graphs and sliding window
It was a coding test with 3 medium-hard questions
based on 2 interviews
Interview experience
Software Developer
4
salaries
| ₹65 L/yr - ₹120 L/yr |
Executive Accountant
4
salaries
| ₹2.4 L/yr - ₹3.2 L/yr |
HR Manager
3
salaries
| ₹3.6 L/yr - ₹5.6 L/yr |
General Manager
3
salaries
| ₹12 L/yr - ₹12 L/yr |
Assistant Manager- HR
3
salaries
| ₹7 L/yr - ₹7.2 L/yr |
HDB Financial Services
AU Small Finance Bank
Bajaj Finance
Equitas Small Finance Bank