Filter interviews by
I applied via campus placement at Indian Institute of Technology (IIT), Chennai and was interviewed in Dec 2016. There was 1 interview round.
To obtain the MST for the new graph, we can use the old graph's MST as a starting point and update it based on the altered edge's weight.
Start with the old graph's MST
Remove the edge with the altered weight from the MST
Add the altered edge to the new graph
Run a minimum spanning tree algorithm on the new graph to obtain the updated MST
The aim is to find an upper bound for the minimum number of nodes in a maximal transitive sub-tournament.
A transitive tournament is one where any three nodes can be arranged in a way that satisfies the transitive property.
A sub-tournament is an induced graph on a subset of nodes from the original tournament.
Every tournament with N nodes contains a transitive sub-tournament of size 2 (a directed edge).
The goal is to fin...
Top trending discussions
posted on 14 Sep 2023
I applied via Naukri.com and was interviewed in Mar 2023. There were 4 interview rounds.
ML and NLP questions
Senior Software Engineer
97
salaries
| ₹5.8 L/yr - ₹21 L/yr |
Software Engineer
45
salaries
| ₹2.2 L/yr - ₹11.1 L/yr |
Lead Engineer
36
salaries
| ₹9 L/yr - ₹23.6 L/yr |
Senior Associate
33
salaries
| ₹1.5 L/yr - ₹5 L/yr |
Data Validation Specialist
31
salaries
| ₹1.5 L/yr - ₹4 L/yr |
Helmerich & Payne
Canon
Ricoh
Konica Minolta Business Solutions India Pvt. Ltd.