Filter interviews by
I applied via campus placement at Indian Statistical Institute (ISI), Bangalore and was interviewed in Dec 2024. There were 2 interview rounds.
Bunch of quant probability questions
Bunch of dp and graph theory
Top trending discussions
I applied via LinkedIn and was interviewed before Jan 2023. There were 2 interview rounds.
posted on 21 Jun 2024
posted on 23 Jun 2024
I applied via campus placement at Indian Institute of Technology (IIT), Roorkee and was interviewed before Jun 2023. There were 6 interview rounds.
3 sections consisting maths, prob stats and CS fundamentals
2 easy to medium-level coding questions
Graph of x+(1/x) is a hyperbola with two branches.
The graph consists of two branches, one in the first quadrant and one in the third quadrant.
As x approaches positive or negative infinity, the graph approaches the x-axis.
The graph has a vertical asymptote at x=0.
The minimum value of the function is 2 when x=1 or x=-1.
I applied via LinkedIn and was interviewed before Mar 2023. There was 1 interview round.
Conflict should be addressed calmly and professionally to find a resolution.
Listen actively to all parties involved to understand their perspectives
Communicate openly and honestly to express your own thoughts and feelings
Focus on finding a solution that benefits all parties, rather than winning the argument
Seek mediation or involve a neutral third party if necessary
Maintain professionalism and respect throughout the co
I applied via LinkedIn and was interviewed before Jan 2023. There were 2 interview rounds.
posted on 2 Dec 2016
I applied via campus placement at Indian Institute of Technology (IIT), Chennai and was interviewed in Dec 2016. There were 4 interview rounds.
Loop in a linkedlist can be found using Floyd's cycle-finding algorithm.
Use two pointers, one moving at a speed of 1 and the other at a speed of 2.
If there is a loop, the two pointers will eventually meet at some point.
If there is no loop, the faster pointer will reach the end of the list.
Time complexity is O(n) and space complexity is O(1).
posted on 2 Dec 2016
I applied via campus placement at Indian Institute of Technology (IIT), Chennai and was interviewed in Dec 2016. There were 5 interview rounds.
Pseudo code to find the k'th largest element in an array
Sort the array in descending order
Return the element at index k-1
Senior Software Developer
5
salaries
| ₹330 L/yr - ₹500 L/yr |
Financial Analyst
4
salaries
| ₹367 L/yr - ₹400 L/yr |
Software Developer
3
salaries
| ₹90 L/yr - ₹400 L/yr |
Manager
3
salaries
| ₹400 L/yr - ₹400 L/yr |
System Engineer
3
salaries
| ₹55 L/yr - ₹160 L/yr |
Citadel
DE Shaw
Renaissance Technologies
Pointo