Filter interviews by
Standard leetcode type questions
Wpf assignment 4 hrs project
Top trending discussions
Binary sort for rotated array
Bloom filters are space-efficient data structures used for quick membership queries.
Space-efficient data structure
Quick membership queries
False positives possible
Design a distributed system for generating tiny URLs
Use a distributed key-value store to store mappings of short URLs to original URLs
Implement a service that generates unique short URLs and stores them in the key-value store
Use a load balancer to distribute requests to multiple instances of the service for scalability
Consider using consistent hashing to evenly distribute the load across nodes in the system
posted on 29 Aug 2024
I applied via Naukri.com
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
Software Engineer
4
salaries
| ₹7.5 L/yr - ₹18 L/yr |
Senior Engineer
3
salaries
| ₹18 L/yr - ₹26 L/yr |
Senior Software Engineer
3
salaries
| ₹27.5 L/yr - ₹43 L/yr |
Associate Implementation Engineer
3
salaries
| ₹8 L/yr - ₹10 L/yr |
Freshworks
Zoho
HCLTech
LTIMindtree