Demandbase SSE Interview Questions and Answers

Binary sort for rotated array

Q1. Bloom filter what advantages
Ans. 
Bloom filters are space-efficient data structures used for quick membership queries.
• Space-efficient data structure

• Quick membership queries

• False positives possible
Answered by AI
Add your answer
Q2. Design tinyurl for distributed system
Ans. 
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
Answered by AI
Add your answer

Q1. Find shortest cycle in graph
Ans. 
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
Answered by AI
Add your answer