i
OpenText Technologies
Filter interviews by
Top trending discussions
I applied via Campus Placement and was interviewed before Sep 2020. There were 2 interview rounds.
I was interviewed before Jun 2020.
Hashmap is a data structure that stores key-value pairs and uses hashing to locate values based on their keys.
Hashmap uses an array to store the key-value pairs
The key is hashed to generate an index in the array
If two keys hash to the same index, a collision occurs and the values are stored in a linked list
Hashmap provides constant time complexity for insertion, deletion, and retrieval of values
I applied via Naukri.com and was interviewed before Jun 2023. There were 2 interview rounds.
I applied via Recruitment Consultant and was interviewed in May 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed before Jul 2022. There were 4 interview rounds.
I applied via Referral and was interviewed in Nov 2023. There was 1 interview round.
To find the shortest cycle in a graph, we can use algorithms like Floyd's Tortoise and Hare algorithm or Breadth-First Search.
Use Floyd's Tortoise and Hare algorithm to detect a cycle in the graph and then find the shortest cycle.
Alternatively, use Breadth-First Search (BFS) to find the shortest cycle in an undirected graph.
Consider the weight of edges if the graph is weighted, as it may affect the shortest cycle lengt
based on 1 interview
Interview experience
Software Engineer
969
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
906
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
363
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Software Engineer
330
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
211
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech