Filter interviews by
Was on Hackerrank and good dsa questions asked
I applied via LinkedIn and was interviewed in May 2024. There were 2 interview rounds.
It was normally reasoning question.
Priniting pattern question.
I was interviewed in Oct 2021.
Round duration - 60 minutes
Round difficulty - Medium
This round was conducted by the Interview Vector, Usually first two rounds are conducted by Interview vector on behalf of mindtickle, Interviewer joined the call on time. He gave his introduction and asked to introduce me. He asked about some of my projects and internships than directly jumped to DSA questions. He shared me the Leetcode question link and I have to write the code there and have to submit it. After that I have to paste my solution on a Google doc shared by him and have to write my approach, Time complexity and space complexity of the solution. So he asked two questions in this round and I solved first one completely and second one partially, questions were of medium and hard difficulty level respectively.
You are provided with an undirected graph having 'N' nodes numbered from 0 to 'N-1'. There is a list 'EDGES' of size 'M', which contains all the edges of this graph. The task is...
You have a directed acyclic graph (DAG). The task is to determine any topological sorting of this graph.
A Directed Acyclic Graph (DAG) is a graph that ha...
Round duration - 60 minutes
Round difficulty - Medium
This round was also conducted by the Interview Vector, we started with the Introduction that she told me that their will be no correct or wrong answer for this round they will check by thinking ability and how vast I can think in designing a system. Than she gave me the problem statement in which I have to design an online Transport renter service. she also shared some requirements with me and shared a google doc where I have to write all the things that will come in my mind. So we discussed about the DB and tables that we will be requiring in this service, we also discussed for different enitities that we'll be requiring than our time gets over and we winded up and Thanked each other and dropped the call.
Round duration - 60 minutes
Round difficulty - Medium
This round was taken by the SDE-2 of the MindTickle and it was also a system design round. We both started with the introduction then he gave me the problem statement to design a chess board game. We both started discussing on it, I started writing down the entities and services that we'll be requring. Than he told me to write the methods in each service and implement them, I got confused in them and started messing up the things. we discussed various things related to methods and services implementation and our time got over than he winded up and asked for any questions and we dropped the call.
Tip 1 : Prepare system design
Tip 2 : Practice as many DSA questions.
Tip 1 : Add Internship and project details clearly
Tip 2 : Add Github links to your projects
Top trending discussions
posted on 15 Oct 2024
I applied via campus placement at KIIT University, Bhuvaneshwar and was interviewed in Apr 2024. There were 3 interview rounds.
Medium level coding questions on hackerrank ,1:30hr, topic- Array , DP , Matrix , Binary Search
posted on 5 Apr 2024
1. Coin change
2. Valid Parenthesis
3. Bipartite graph question
The question involves finding duplicates in an array, validating parentheses, generating random IDs, and determining the maximum number of random IDs that can be generated.
To find duplicates in an array, you can use a hash set to store unique elements and check for duplicates as you iterate through the array.
To validate parentheses, you can use a stack data structure to keep track of opening and closing parentheses.
To ...
I applied via LinkedIn and was interviewed in Mar 2024. There were 4 interview rounds.
The questions were asked from SQL and Python
General Topics - Mostly checking the communication
I was interviewed in Feb 2021.
Round duration - 90 minutes
Round difficulty - Medium
Timing was 10AM. The platform was quite good.
You are provided with an N * M
sized binary matrix 'MAT' where 'N' denotes the number of rows and 'M' denotes the number of columns. Your t...
Determine the maximum path sum for any path in a given binary tree with 'N' nodes.
Note:
Find the minimum number of swaps required to sort a given array of distinct elements in ascending order.
T (number of test cases)
For each test case:
N (siz...
Convert a given infix expression, represented as a string EXP
, into its equivalent postfix expression.
An infix expression is formatted as a op b
where the opera...
Tip 1 : Do at least 1 project.
Tip 2 : Practice data structure questions.
Tip 3 : Dynamic programming is must.
Tip 1 : Do not put false things.
Tip 2 : Keep it short and direct.
I was interviewed before May 2016.
I applied via Walk-in and was interviewed before Oct 2023. There were 2 interview rounds.
Basic logical reasoning
Ai topic group discussion around 40 members but speak clearly and don't make mistakes on the grammar part
I was interviewed in Feb 2021.
Round duration - 90 minutes
Round difficulty - Medium
Timing was 10AM. The platform was quite good.
Given an N x M binary matrix 'MAT', where N is the number of rows and M is the number of columns, determine the maximum area of a submatrix consisting entire...
If the height of bars of the histogram is given then the largest area of the histogram can be found. This way in each row, the largest area of bars of the histogram can be found. To get the largest rectangle full of 1’s, update the next row with the previous row and find the largest area under the histogram, i.e. consider each 1’s as filled squares and 0’s with an empty square and consider each row as the base.
Your task is to determine the maximum possible sum of a simple path between any two nodes (possibly the same) in a given binary tree of 'N' nodes with integer values.
For each node there can be four ways that the max path goes through the node:
1. Node only
2. Max path through Left Child + Node
3. Max path through Right Child + Node
4. Max path through Left Child + Node + Max path through Right Child
Find the minimum number of swaps required to sort a given array of distinct elements in ascending order.
T (number of test cases)
For each test case:
N (siz...
This can be easily done by visualizing the problem as a graph. We will have n nodes and an edge directed from node i to node j if the element at i’th index must be present at j’th index in the sorted array.
Transform a string representing a valid Prefix expression, which may contain operators '+', '-', '*', '/', and uppercase letters, into its corresponding Infix expression.
Algorithm for Prefix to Infix:
Read the Prefix expression in reverse order (from right to left)
If the symbol is an operand, then push it onto the Stack
If the symbol is an operator, then pop two operands from the Stack
Create a string by concatenating the two operands and the operator between them.
string = (operand1 + operator + operand2)
And push the resultant string back to Stack
Repeat the above steps until end of Prefix
Tip 1 : Do at least 1 project.
Tip 2 : Practice data structure questions.
Tip 3 : Dynamic programming is must.
Tip 1 : Do not put false things.
Tip 2 : Keep it short and direct.
based on 2 interviews
Interview experience
Software Development Engineer II
25
salaries
| ₹20 L/yr - ₹45 L/yr |
Software Development Engineer
20
salaries
| ₹13 L/yr - ₹35 L/yr |
Senior Software Engineer
19
salaries
| ₹16.6 L/yr - ₹70.2 L/yr |
Software Engineer
13
salaries
| ₹8.6 L/yr - ₹36 L/yr |
Customer Success Engineer
10
salaries
| ₹4 L/yr - ₹7 L/yr |
Freshworks
Zoho
InMobi
Mu Sigma